TSTP Solution File: LCL230-3 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL230-3 : TPTP v8.1.0. Released v2.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 : n011.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 : Sun Jul 17 12:07:56 EDT 2022

% Result   : Unsatisfiable 0.22s 0.56s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : LCL230-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.35  % Computer : n011.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Sun Jul  3 00:43:35 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 0.22/0.56  % SZS status Unsatisfiable
% 0.22/0.56  % SZS output begin IncompleteProof
% 0.22/0.56  cnf(c0, axiom,
% 0.22/0.56  	~theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))))).
% 0.22/0.56  cnf(c1, plain,
% 0.22/0.56  	~theorem(or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
% 0.22/0.56  	inference(start, [], [c0])).
% 0.22/0.56  
% 0.22/0.56  cnf(c2, axiom,
% 0.22/0.56  	~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)).
% 0.22/0.56  cnf(a0, assumption,
% 0.22/0.56  	or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r))) = X1).
% 0.22/0.56  cnf(c3, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.22/0.56  cnf(c4, plain,
% 0.22/0.56  	~theorem(X0) | ~theorem(or(not(X0),X1)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.22/0.56  
% 0.22/0.56  cnf(c5, axiom,
% 0.22/0.56  	~theorem(X2) | ~theorem(or(not(X2),X3)) | theorem(X3)).
% 0.22/0.56  cnf(a1, assumption,
% 0.22/0.56  	X0 = X3).
% 0.22/0.56  cnf(c6, plain,
% 0.22/0.56  	~theorem(or(not(X0),X1)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.22/0.56  cnf(c7, plain,
% 0.22/0.56  	~theorem(X2) | ~theorem(or(not(X2),X3)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.22/0.56  
% 0.22/0.56  cnf(c8, axiom,
% 0.22/0.56  	~axiom(X4) | theorem(X4)).
% 0.22/0.56  cnf(a2, assumption,
% 0.22/0.56  	X2 = X4).
% 0.22/0.56  cnf(c9, plain,
% 0.22/0.56  	~theorem(or(not(X2),X3)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.22/0.56  cnf(c10, plain,
% 0.22/0.56  	~axiom(X4),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.22/0.56  
% 0.22/0.56  cnf(c11, axiom,
% 0.22/0.56  	axiom(or(not(X5),or(X6,X5)))).
% 0.22/0.56  cnf(a3, assumption,
% 0.22/0.56  	X4 = or(not(X5),or(X6,X5))).
% 0.22/0.56  cnf(c12, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.22/0.56  cnf(c13, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.22/0.56  
% 0.22/0.56  cnf(c14, axiom,
% 0.22/0.56  	~theorem(X7) | ~theorem(or(not(X7),X8)) | theorem(X8)).
% 0.22/0.56  cnf(a4, assumption,
% 0.22/0.56  	or(not(X2),X3) = X8).
% 0.22/0.56  cnf(c15, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])).
% 0.22/0.56  cnf(c16, plain,
% 0.22/0.56  	~theorem(X7) | ~theorem(or(not(X7),X8)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])).
% 0.22/0.56  
% 0.22/0.56  cnf(c17, axiom,
% 0.22/0.56  	~axiom(X9) | theorem(X9)).
% 0.22/0.56  cnf(a5, assumption,
% 0.22/0.56  	X7 = X9).
% 0.22/0.56  cnf(c18, plain,
% 0.22/0.56  	~theorem(or(not(X7),X8)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.22/0.56  cnf(c19, plain,
% 0.22/0.56  	~axiom(X9),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.22/0.56  
% 0.22/0.56  cnf(c20, axiom,
% 0.22/0.56  	axiom(or(not(or(not(X10),X11)),or(not(or(X12,X10)),or(X12,X11))))).
% 0.22/0.56  cnf(a6, assumption,
% 0.22/0.56  	X9 = or(not(or(not(X10),X11)),or(not(or(X12,X10)),or(X12,X11)))).
% 0.22/0.56  cnf(c21, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.22/0.56  cnf(c22, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.22/0.56  
% 0.22/0.56  cnf(c23, axiom,
% 0.22/0.56  	~axiom(X13) | theorem(X13)).
% 0.22/0.56  cnf(a7, assumption,
% 0.22/0.56  	or(not(X7),X8) = X13).
% 0.22/0.56  cnf(c24, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 0.22/0.56  cnf(c25, plain,
% 0.22/0.56  	~axiom(X13),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 0.22/0.56  
% 0.22/0.56  cnf(c26, axiom,
% 0.22/0.56  	axiom(or(not(or(X14,or(X15,X16))),or(X15,or(X14,X16))))).
% 0.22/0.56  cnf(a8, assumption,
% 0.22/0.56  	X13 = or(not(or(X14,or(X15,X16))),or(X15,or(X14,X16)))).
% 0.22/0.56  cnf(c27, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 0.22/0.56  cnf(c28, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 0.22/0.56  
% 0.22/0.56  cnf(c29, axiom,
% 0.22/0.56  	~theorem(X17) | ~theorem(or(not(X17),X18)) | theorem(X18)).
% 0.22/0.56  cnf(a9, assumption,
% 0.22/0.56  	or(not(X0),X1) = X18).
% 0.22/0.56  cnf(c30, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a9])], [c6, c29])).
% 0.22/0.56  cnf(c31, plain,
% 0.22/0.56  	~theorem(X17) | ~theorem(or(not(X17),X18)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a9])], [c6, c29])).
% 0.22/0.56  
% 0.22/0.56  cnf(c32, axiom,
% 0.22/0.56  	~axiom(X19) | theorem(X19)).
% 0.22/0.56  cnf(a10, assumption,
% 0.22/0.56  	X17 = X19).
% 0.22/0.56  cnf(c33, plain,
% 0.22/0.56  	~theorem(or(not(X17),X18)),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])).
% 0.22/0.56  cnf(c34, plain,
% 0.22/0.56  	~axiom(X19),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])).
% 0.22/0.56  
% 0.22/0.56  cnf(c35, axiom,
% 0.22/0.56  	axiom(or(not(or(X20,or(X21,X22))),or(X21,or(X20,X22))))).
% 0.22/0.56  cnf(a11, assumption,
% 0.22/0.56  	X19 = or(not(or(X20,or(X21,X22))),or(X21,or(X20,X22)))).
% 0.22/0.56  cnf(c36, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 0.22/0.56  cnf(c37, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 0.22/0.56  
% 0.22/0.56  cnf(c38, axiom,
% 0.22/0.56  	~axiom(X23) | theorem(X23)).
% 0.22/0.56  cnf(a12, assumption,
% 0.22/0.56  	or(not(X17),X18) = X23).
% 0.22/0.56  cnf(c39, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a12])], [c33, c38])).
% 0.22/0.56  cnf(c40, plain,
% 0.22/0.56  	~axiom(X23),
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a12])], [c33, c38])).
% 0.22/0.56  
% 0.22/0.56  cnf(c41, axiom,
% 0.22/0.56  	axiom(or(not(or(not(X24),X25)),or(not(or(X26,X24)),or(X26,X25))))).
% 0.22/0.56  cnf(a13, assumption,
% 0.22/0.56  	X23 = or(not(or(not(X24),X25)),or(not(or(X26,X24)),or(X26,X25)))).
% 0.22/0.56  cnf(c42, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 0.22/0.56  cnf(c43, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 0.22/0.56  
% 0.22/0.56  cnf(c44, plain,
% 0.22/0.56  	$false,
% 0.22/0.56  	inference(constraint_solving, [
% 0.22/0.56  		bind(X0, or(X14,X16)),
% 0.22/0.56  		bind(X1, or(not(or(not(or(p,q)),or(p,r))),or(p,or(not(q),r)))),
% 0.22/0.56  		bind(X2, or(not(X5),or(X6,X5))),
% 0.22/0.56  		bind(X3, or(X14,X16)),
% 0.22/0.56  		bind(X4, or(not(X5),or(X6,X5))),
% 0.22/0.56  		bind(X5, q),
% 0.22/0.56  		bind(X6, p),
% 0.22/0.56  		bind(X7, or(not(or(not(X10),X11)),or(not(or(X12,X10)),or(X12,X11)))),
% 0.22/0.56  		bind(X8, or(not(X2),X3)),
% 0.22/0.56  		bind(X9, or(not(or(not(X10),X11)),or(not(or(X12,X10)),or(X12,X11)))),
% 0.22/0.56  		bind(X10, or(X6,X5)),
% 0.22/0.56  		bind(X11, or(X21,X22)),
% 0.22/0.56  		bind(X12, not(X5)),
% 0.22/0.56  		bind(X13, or(not(X7),X8)),
% 0.22/0.56  		bind(X14, not(or(not(X10),X11))),
% 0.22/0.56  		bind(X15, not(or(X12,X10))),
% 0.22/0.56  		bind(X16, or(X12,X11)),
% 0.22/0.56  		bind(X17, or(not(or(X20,or(X21,X22))),or(X21,or(X20,X22)))),
% 0.22/0.56  		bind(X18, or(not(X0),X1)),
% 0.22/0.56  		bind(X19, or(not(or(X20,or(X21,X22))),or(X21,or(X20,X22)))),
% 0.22/0.56  		bind(X20, not(X5)),
% 0.22/0.56  		bind(X21, p),
% 0.22/0.56  		bind(X22, r),
% 0.22/0.56  		bind(X23, or(not(X17),X18)),
% 0.22/0.56  		bind(X24, or(X20,or(X21,X22))),
% 0.22/0.56  		bind(X25, or(X21,or(X20,X22))),
% 0.22/0.56  		bind(X26, not(or(not(X10),X11)))
% 0.22/0.56  	],
% 0.22/0.56  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.22/0.56  
% 0.22/0.56  % SZS output end IncompleteProof
%------------------------------------------------------------------------------