↑ Up

lazyCoP---0.1.UNS-Ass.s

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

% Computer : n004.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:07:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN009-3 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n004.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 20:09:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % SZS status Unsatisfiable
% 0.12/0.34  % SZS output begin IncompleteProof
% 0.12/0.34  cnf(c0, axiom,
% 0.12/0.34  	~t(X0,X1,X2) | ~p(X0,X1,X2)).
% 0.12/0.34  cnf(c1, plain,
% 0.12/0.34  	~t(X0,X1,X2) | ~p(X0,X1,X2),
% 0.12/0.34  	inference(start, [], [c0])).
% 0.12/0.34  
% 0.12/0.34  cnf(c2, axiom,
% 0.12/0.34  	v(X3,X4,X5) | t(X3,X4,X5) | ~u(X3,X4,X5)).
% 0.12/0.34  cnf(a0, assumption,
% 0.12/0.34  	X0 = X3).
% 0.12/0.34  cnf(a1, assumption,
% 0.12/0.34  	X1 = X4).
% 0.12/0.34  cnf(a2, assumption,
% 0.12/0.34  	X2 = X5).
% 0.12/0.34  cnf(c3, plain,
% 0.12/0.34  	~p(X0,X1,X2),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34  cnf(c4, plain,
% 0.12/0.34  	v(X3,X4,X5) | ~u(X3,X4,X5),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34  
% 0.12/0.34  cnf(c5, axiom,
% 0.12/0.34  	~v(X6,X7,X8)).
% 0.12/0.34  cnf(a3, assumption,
% 0.12/0.34  	X3 = X6).
% 0.12/0.34  cnf(a4, assumption,
% 0.12/0.34  	X4 = X7).
% 0.12/0.34  cnf(a5, assumption,
% 0.12/0.34  	X5 = X8).
% 0.12/0.34  cnf(c6, plain,
% 0.12/0.34  	~u(X3,X4,X5),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.12/0.34  cnf(c7, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 0.12/0.34  
% 0.12/0.34  cnf(c8, axiom,
% 0.12/0.34  	u(c,c,c)).
% 0.12/0.34  cnf(a6, assumption,
% 0.12/0.34  	X3 = c).
% 0.12/0.34  cnf(a7, assumption,
% 0.12/0.34  	X4 = c).
% 0.12/0.34  cnf(a8, assumption,
% 0.12/0.34  	X5 = c).
% 0.12/0.34  cnf(c9, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.12/0.34  cnf(c10, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c6, c8])).
% 0.12/0.34  
% 0.12/0.34  cnf(c11, axiom,
% 0.12/0.34  	r(X9,X10,X11) | q(X9,X10,X11) | p(X9,X10,X11) | ~s(X11) | ~s(X10) | ~s(X9)).
% 0.12/0.34  cnf(a9, assumption,
% 0.12/0.34  	X0 = X9).
% 0.12/0.34  cnf(a10, assumption,
% 0.12/0.34  	X1 = X10).
% 0.12/0.34  cnf(a11, assumption,
% 0.12/0.34  	X2 = X11).
% 0.12/0.34  cnf(c12, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c3, c11])).
% 0.12/0.34  cnf(c13, plain,
% 0.12/0.34  	r(X9,X10,X11) | q(X9,X10,X11) | ~s(X11) | ~s(X10) | ~s(X9),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c3, c11])).
% 0.12/0.34  
% 0.12/0.34  cnf(c14, axiom,
% 0.12/0.34  	~t(X12,X13,X14) | ~r(X12,X13,X14)).
% 0.12/0.34  cnf(a12, assumption,
% 0.12/0.34  	X9 = X12).
% 0.12/0.34  cnf(a13, assumption,
% 0.12/0.34  	X10 = X13).
% 0.12/0.34  cnf(a14, assumption,
% 0.12/0.34  	X11 = X14).
% 0.12/0.34  cnf(c15, plain,
% 0.12/0.34  	q(X9,X10,X11) | ~s(X11) | ~s(X10) | ~s(X9),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])).
% 0.12/0.34  cnf(c16, plain,
% 0.12/0.34  	~t(X12,X13,X14),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c14])).
% 0.12/0.34  
% 0.12/0.34  cnf(c17, plain,
% 0.12/0.34  	t(X0,X1,X2)).
% 0.12/0.34  cnf(a15, assumption,
% 0.12/0.34  	X12 = X0).
% 0.12/0.34  cnf(a16, assumption,
% 0.12/0.34  	X13 = X1).
% 0.12/0.34  cnf(a17, assumption,
% 0.12/0.34  	X14 = X2).
% 0.12/0.34  cnf(c18, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a15, a16, a17])], [c16, c17])).
% 0.12/0.34  
% 0.12/0.34  cnf(c19, axiom,
% 0.12/0.34  	~t(X15,X16,X17) | ~q(X15,X16,X17)).
% 0.12/0.34  cnf(a18, assumption,
% 0.12/0.34  	X9 = X15).
% 0.12/0.34  cnf(a19, assumption,
% 0.12/0.34  	X10 = X16).
% 0.12/0.34  cnf(a20, assumption,
% 0.12/0.34  	X11 = X17).
% 0.12/0.34  cnf(c20, plain,
% 0.12/0.34  	~s(X11) | ~s(X10) | ~s(X9),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c15, c19])).
% 0.12/0.34  cnf(c21, plain,
% 0.12/0.34  	~t(X15,X16,X17),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a18, a19, a20])], [c15, c19])).
% 0.12/0.34  
% 0.12/0.34  cnf(c22, plain,
% 0.12/0.34  	t(X0,X1,X2)).
% 0.12/0.34  cnf(a21, assumption,
% 0.12/0.34  	X15 = X0).
% 0.12/0.34  cnf(a22, assumption,
% 0.12/0.34  	X16 = X1).
% 0.12/0.34  cnf(a23, assumption,
% 0.12/0.34  	X17 = X2).
% 0.12/0.34  cnf(c23, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a21, a22, a23])], [c21, c22])).
% 0.12/0.34  
% 0.12/0.34  cnf(c24, axiom,
% 0.12/0.34  	s(c)).
% 0.12/0.34  cnf(a24, assumption,
% 0.12/0.34  	X11 = c).
% 0.12/0.34  cnf(c25, plain,
% 0.12/0.34  	~s(X10) | ~s(X9),
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a24])], [c20, c24])).
% 0.12/0.34  cnf(c26, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(strict_predicate_extension, [assumptions([a24])], [c20, c24])).
% 0.12/0.34  
% 0.12/0.34  cnf(c27, plain,
% 0.12/0.34  	s(X11)).
% 0.12/0.34  cnf(a25, assumption,
% 0.12/0.34  	X10 = X11).
% 0.12/0.34  cnf(c28, plain,
% 0.12/0.34  	~s(X9),
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a25])], [c25, c27])).
% 0.12/0.34  
% 0.12/0.34  cnf(c29, plain,
% 0.12/0.34  	s(X11)).
% 0.12/0.34  cnf(a26, assumption,
% 0.12/0.34  	X9 = X11).
% 0.12/0.34  cnf(c30, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(predicate_reduction, [assumptions([a26])], [c28, c29])).
% 0.12/0.34  
% 0.12/0.34  cnf(c31, plain,
% 0.12/0.34  	$false,
% 0.12/0.34  	inference(constraint_solving, [
% 0.12/0.34  		bind(X0, c),
% 0.12/0.34  		bind(X1, c),
% 0.12/0.34  		bind(X2, c),
% 0.12/0.34  		bind(X3, c),
% 0.12/0.34  		bind(X4, c),
% 0.12/0.34  		bind(X5, c),
% 0.12/0.34  		bind(X6, c),
% 0.12/0.34  		bind(X7, c),
% 0.12/0.34  		bind(X8, c),
% 0.12/0.34  		bind(X9, c),
% 0.12/0.34  		bind(X10, c),
% 0.12/0.34  		bind(X11, c),
% 0.12/0.34  		bind(X12, c),
% 0.12/0.34  		bind(X13, c),
% 0.12/0.34  		bind(X14, c),
% 0.12/0.34  		bind(X15, c),
% 0.12/0.34  		bind(X16, c),
% 0.12/0.34  		bind(X17, c)
% 0.12/0.34  	],
% 0.12/0.34  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26])).
% 0.12/0.34  
% 0.12/0.34  % SZS output end IncompleteProof
%------------------------------------------------------------------------------