↑ Up

lazyCoP---0.1.UNS-Ass.s

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

% Computer : n007.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 : Tue Jul 19 21:07:54 EDT 2022

% Result   : Unsatisfiable 4.15s 0.90s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWC255-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n007.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 11 19:37:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 4.15/0.90  % SZS status Unsatisfiable
% 4.15/0.90  % SZS output begin IncompleteProof
% 4.15/0.90  cnf(c0, axiom,
% 4.15/0.90  	sk2 = sk4).
% 4.15/0.90  cnf(c1, plain,
% 4.15/0.90  	sk2 = sk4,
% 4.15/0.90  	inference(start, [], [c0])).
% 4.15/0.90  
% 4.15/0.90  cnf(c2, axiom,
% 4.15/0.90  	~neq(sk4,nil) | singletonP(sk3)).
% 4.15/0.90  cnf(a0, assumption,
% 4.15/0.90  	sk4 = sk4).
% 4.15/0.90  cnf(a1, assumption,
% 4.15/0.90  	sk2 = X0).
% 4.15/0.90  cnf(c3, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.15/0.90  cnf(c4, plain,
% 4.15/0.90  	singletonP(sk3),
% 4.15/0.90  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.15/0.90  cnf(c5, plain,
% 4.15/0.90  	~neq(X0,nil),
% 4.15/0.90  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 4.15/0.90  
% 4.15/0.90  cnf(c6, axiom,
% 4.15/0.90  	neq(sk2,nil)).
% 4.15/0.90  cnf(a2, assumption,
% 4.15/0.90  	X0 = sk2).
% 4.15/0.90  cnf(a3, assumption,
% 4.15/0.90  	nil = nil).
% 4.15/0.90  cnf(c7, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.15/0.90  cnf(c8, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])).
% 4.15/0.90  
% 4.15/0.90  cnf(c9, axiom,
% 4.15/0.90  	sk1 = sk3).
% 4.15/0.90  cnf(a4, assumption,
% 4.15/0.90  	sk3 = sk3).
% 4.15/0.90  cnf(c10, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(strict_function_extension, [assumptions([a4])], [c4, c9])).
% 4.15/0.90  cnf(c11, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(strict_function_extension, [assumptions([a4])], [c4, c9])).
% 4.15/0.90  cnf(c12, plain,
% 4.15/0.90  	X1 != sk1 | singletonP(X1),
% 4.15/0.90  	inference(strict_function_extension, [assumptions([a4])], [c4, c9])).
% 4.15/0.90  
% 4.15/0.90  cnf(a5, assumption,
% 4.15/0.90  	X1 = sk1).
% 4.15/0.90  cnf(c13, plain,
% 4.15/0.90  	singletonP(X1),
% 4.15/0.90  	inference(reflexivity, [assumptions([a5])], [c12])).
% 4.15/0.90  
% 4.15/0.90  cnf(c14, axiom,
% 4.15/0.90  	~neq(sk4,nil) | ~singletonP(sk1)).
% 4.15/0.90  cnf(a6, assumption,
% 4.15/0.90  	X1 = sk1).
% 4.15/0.90  cnf(c15, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])).
% 4.15/0.90  cnf(c16, plain,
% 4.15/0.90  	~neq(sk4,nil),
% 4.15/0.90  	inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])).
% 4.15/0.90  
% 4.15/0.90  cnf(c17, plain,
% 4.15/0.90  	neq(sk4,nil)).
% 4.15/0.90  cnf(a7, assumption,
% 4.15/0.90  	sk4 = sk4).
% 4.15/0.90  cnf(a8, assumption,
% 4.15/0.90  	nil = nil).
% 4.15/0.90  cnf(c18, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(predicate_reduction, [assumptions([a7, a8])], [c16, c17])).
% 4.15/0.90  
% 4.15/0.90  cnf(c19, plain,
% 4.15/0.90  	$false,
% 4.15/0.90  	inference(constraint_solving, [
% 4.15/0.90  		bind(X0, sk2),
% 4.15/0.90  		bind(X1, sk1)
% 4.15/0.90  	],
% 4.15/0.90  	[a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 4.15/0.90  
% 4.15/0.90  % SZS output end IncompleteProof
%------------------------------------------------------------------------------