↑ Up

lazyCoP---0.1.UNS-Ass.s

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

% Computer : n003.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 08:08:46 EDT 2022

% Result   : Unsatisfiable 0.12s 0.35s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN189-1 : TPTP v8.1.0. Released v1.1.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 : n003.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 : Mon Jul 11 15:36:30 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  % SZS status Unsatisfiable
% 0.12/0.35  % SZS output begin IncompleteProof
% 0.12/0.35  cnf(c0, axiom,
% 0.12/0.35  	~r2(c)).
% 0.12/0.35  cnf(c1, plain,
% 0.12/0.35  	~r2(c),
% 0.12/0.35  	inference(start, [], [c0])).
% 0.12/0.35  
% 0.12/0.35  cnf(c2, axiom,
% 0.12/0.35  	~l0(X0) | ~r1(X0) | r2(X0)).
% 0.12/0.35  cnf(a0, assumption,
% 0.12/0.35  	c = X0).
% 0.12/0.35  cnf(c3, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  cnf(c4, plain,
% 0.12/0.35  	~l0(X0) | ~r1(X0),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.35  
% 0.12/0.35  cnf(c5, axiom,
% 0.12/0.35  	l0(c)).
% 0.12/0.35  cnf(a1, assumption,
% 0.12/0.35  	X0 = c).
% 0.12/0.35  cnf(c6, plain,
% 0.12/0.35  	~r1(X0),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35  cnf(c7, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.12/0.35  
% 0.12/0.35  cnf(c8, axiom,
% 0.12/0.35  	~q1(d,X1,d) | ~s0(d) | ~q0(X2,X1) | r1(X2)).
% 0.12/0.35  cnf(a2, assumption,
% 0.12/0.35  	X0 = X2).
% 0.12/0.35  cnf(c9, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.12/0.35  cnf(c10, plain,
% 0.12/0.35  	~q1(d,X1,d) | ~s0(d) | ~q0(X2,X1),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.12/0.35  
% 0.12/0.35  cnf(c11, axiom,
% 0.12/0.35  	~s0(X3) | q1(X3,X3,X3)).
% 0.12/0.35  cnf(a3, assumption,
% 0.12/0.35  	d = X3).
% 0.12/0.35  cnf(a4, assumption,
% 0.12/0.35  	X1 = X3).
% 0.12/0.35  cnf(a5, assumption,
% 0.12/0.35  	d = X3).
% 0.12/0.35  cnf(c12, plain,
% 0.12/0.35  	~s0(d) | ~q0(X2,X1),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c10, c11])).
% 0.12/0.35  cnf(c13, plain,
% 0.12/0.35  	~s0(X3),
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c10, c11])).
% 0.12/0.35  
% 0.12/0.35  cnf(c14, axiom,
% 0.12/0.35  	s0(d)).
% 0.12/0.35  cnf(a6, assumption,
% 0.12/0.35  	X3 = d).
% 0.12/0.35  cnf(c15, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])).
% 0.12/0.35  cnf(c16, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a6])], [c13, c14])).
% 0.12/0.35  
% 0.12/0.35  cnf(c17, plain,
% 0.12/0.35  	s0(X3)).
% 0.12/0.35  cnf(a7, assumption,
% 0.12/0.35  	d = X3).
% 0.12/0.35  cnf(c18, plain,
% 0.12/0.35  	~q0(X2,X1),
% 0.12/0.35  	inference(predicate_reduction, [assumptions([a7])], [c12, c17])).
% 0.12/0.35  
% 0.12/0.35  cnf(c19, axiom,
% 0.12/0.35  	q0(X4,d)).
% 0.12/0.35  cnf(a8, assumption,
% 0.12/0.35  	X2 = X4).
% 0.12/0.35  cnf(a9, assumption,
% 0.12/0.35  	X1 = d).
% 0.12/0.35  cnf(c20, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c18, c19])).
% 0.12/0.35  cnf(c21, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c18, c19])).
% 0.12/0.35  
% 0.12/0.35  cnf(c22, plain,
% 0.12/0.35  	$false,
% 0.12/0.35  	inference(constraint_solving, [
% 0.12/0.35  		bind(X0, c),
% 0.12/0.35  		bind(X1, d),
% 0.12/0.35  		bind(X2, c),
% 0.12/0.35  		bind(X3, d),
% 0.12/0.35  		bind(X4, c)
% 0.12/0.35  	],
% 0.12/0.35  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.12/0.35  
% 0.12/0.35  % SZS output end IncompleteProof
%------------------------------------------------------------------------------