↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 21 00:45:53 EDT 2022

% Result   : Theorem 0.13s 0.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% 0.04/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun  4 12:14:37 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % SZS status Theorem
% 0.13/0.36  % SZS output begin IncompleteProof
% 0.13/0.36  cnf(c0, axiom,
% 0.13/0.36  	sK2 = X0 | ~is_state(X0)).
% 0.13/0.36  cnf(c1, plain,
% 0.13/0.36  	sK2 = X0 | ~is_state(X0),
% 0.13/0.36  	inference(start, [], [c0])).
% 0.13/0.36  
% 0.13/0.36  cnf(c2, axiom,
% 0.13/0.36  	sK2 = X1 | ~is_state(X1)).
% 0.13/0.36  cnf(a0, assumption,
% 0.13/0.36  	sK2 = sK2).
% 0.13/0.36  cnf(c3, plain,
% 0.13/0.36  	~is_state(X0),
% 0.13/0.36  	inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.36  cnf(c4, plain,
% 0.13/0.36  	~is_state(X1),
% 0.13/0.36  	inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.36  cnf(c5, plain,
% 0.13/0.36  	X0 = X1,
% 0.13/0.36  	inference(strict_subterm_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.36  
% 0.13/0.36  cnf(c6, axiom,
% 0.13/0.36  	sK0 != sK1 | ~hoare_165779456gleton).
% 0.13/0.36  cnf(a1, assumption,
% 0.13/0.36  	sK1 = X0).
% 0.13/0.36  cnf(c7, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(strict_subterm_extension, [assumptions([a1])], [c5, c6])).
% 0.13/0.36  cnf(c8, plain,
% 0.13/0.36  	~hoare_165779456gleton,
% 0.13/0.36  	inference(strict_subterm_extension, [assumptions([a1])], [c5, c6])).
% 0.13/0.36  cnf(c9, plain,
% 0.13/0.36  	sK0 != X1,
% 0.13/0.36  	inference(strict_subterm_extension, [assumptions([a1])], [c5, c6])).
% 0.13/0.36  
% 0.13/0.36  cnf(a2, assumption,
% 0.13/0.36  	sK0 = X1).
% 0.13/0.36  cnf(c10, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(reflexivity, [assumptions([a2])], [c9])).
% 0.13/0.36  
% 0.13/0.36  cnf(c11, axiom,
% 0.13/0.36  	hoare_165779456gleton).
% 0.13/0.36  cnf(c12, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(strict_predicate_extension, [], [c8, c11])).
% 0.13/0.36  cnf(c13, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(strict_predicate_extension, [], [c8, c11])).
% 0.13/0.36  
% 0.13/0.36  cnf(c14, axiom,
% 0.13/0.36  	is_state(sK0) | ~hoare_165779456gleton).
% 0.13/0.36  cnf(a3, assumption,
% 0.13/0.36  	X1 = sK0).
% 0.13/0.36  cnf(c15, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(strict_predicate_extension, [assumptions([a3])], [c4, c14])).
% 0.13/0.36  cnf(c16, plain,
% 0.13/0.36  	~hoare_165779456gleton,
% 0.13/0.36  	inference(strict_predicate_extension, [assumptions([a3])], [c4, c14])).
% 0.13/0.36  
% 0.13/0.36  cnf(c17, plain,
% 0.13/0.36  	hoare_165779456gleton).
% 0.13/0.36  cnf(c18, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(predicate_reduction, [], [c16, c17])).
% 0.13/0.36  
% 0.13/0.36  cnf(c19, axiom,
% 0.13/0.36  	is_state(sK1) | ~hoare_165779456gleton).
% 0.13/0.36  cnf(a4, assumption,
% 0.13/0.36  	X0 = sK1).
% 0.13/0.36  cnf(c20, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(strict_predicate_extension, [assumptions([a4])], [c3, c19])).
% 0.13/0.36  cnf(c21, plain,
% 0.13/0.36  	~hoare_165779456gleton,
% 0.13/0.36  	inference(strict_predicate_extension, [assumptions([a4])], [c3, c19])).
% 0.13/0.36  
% 0.13/0.36  cnf(c22, plain,
% 0.13/0.36  	hoare_165779456gleton).
% 0.13/0.36  cnf(c23, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(predicate_reduction, [], [c21, c22])).
% 0.13/0.36  
% 0.13/0.36  cnf(c24, plain,
% 0.13/0.36  	$false,
% 0.13/0.36  	inference(constraint_solving, [
% 0.13/0.36  		bind(X0, sK1),
% 0.13/0.36  		bind(X1, sK0)
% 0.13/0.36  	],
% 0.13/0.36  	[a0, a1, a2, a3, a4])).
% 0.13/0.36  
% 0.13/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------