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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL219-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 : n017.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:48 EDT 2022

% Result   : Unsatisfiable 61.48s 8.07s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL219-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33  % Computer : n017.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 : Sun Jul  3 22:44:26 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 61.48/8.07  % SZS status Unsatisfiable
% 61.48/8.07  % SZS output begin IncompleteProof
% 61.48/8.07  cnf(c0, axiom,
% 61.48/8.07  	~theorem(or(not(or(not(or(not(p),q)),q)),or(p,q)))).
% 61.48/8.07  cnf(c1, plain,
% 61.48/8.07  	~theorem(or(not(or(not(or(not(p),q)),q)),or(p,q))),
% 61.48/8.07  	inference(start, [], [c0])).
% 61.48/8.07  
% 61.48/8.07  cnf(c2, axiom,
% 61.48/8.07  	~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)).
% 61.48/8.07  cnf(a0, assumption,
% 61.48/8.07  	or(not(or(not(or(not(p),q)),q)),or(p,q)) = X1).
% 61.48/8.07  cnf(c3, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 61.48/8.07  cnf(c4, plain,
% 61.48/8.07  	~theorem(X0) | ~theorem(or(not(X0),X1)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 61.48/8.07  
% 61.48/8.07  cnf(c5, axiom,
% 61.48/8.07  	~theorem(X2) | ~theorem(or(not(X2),X3)) | theorem(X3)).
% 61.48/8.07  cnf(a1, assumption,
% 61.48/8.07  	X0 = X3).
% 61.48/8.07  cnf(c6, plain,
% 61.48/8.07  	~theorem(or(not(X0),X1)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 61.48/8.07  cnf(c7, plain,
% 61.48/8.07  	~theorem(X2) | ~theorem(or(not(X2),X3)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 61.48/8.07  
% 61.48/8.07  cnf(c8, axiom,
% 61.48/8.07  	~theorem(X4) | ~theorem(or(not(X4),X5)) | theorem(X5)).
% 61.48/8.07  cnf(a2, assumption,
% 61.48/8.07  	X2 = X5).
% 61.48/8.07  cnf(c9, plain,
% 61.48/8.07  	~theorem(or(not(X2),X3)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 61.48/8.07  cnf(c10, plain,
% 61.48/8.07  	~theorem(X4) | ~theorem(or(not(X4),X5)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 61.48/8.07  
% 61.48/8.07  cnf(c11, axiom,
% 61.48/8.07  	~axiom(X6) | theorem(X6)).
% 61.48/8.07  cnf(a3, assumption,
% 61.48/8.07  	X4 = X6).
% 61.48/8.07  cnf(c12, plain,
% 61.48/8.07  	~theorem(or(not(X4),X5)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 61.48/8.07  cnf(c13, plain,
% 61.48/8.07  	~axiom(X6),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 61.48/8.07  
% 61.48/8.07  cnf(c14, axiom,
% 61.48/8.07  	axiom(or(not(X7),or(X8,X7)))).
% 61.48/8.07  cnf(a4, assumption,
% 61.48/8.07  	X6 = or(not(X7),or(X8,X7))).
% 61.48/8.07  cnf(c15, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 61.48/8.07  cnf(c16, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 61.48/8.07  
% 61.48/8.07  cnf(c17, axiom,
% 61.48/8.07  	~theorem(X9) | ~theorem(or(not(X9),X10)) | theorem(X10)).
% 61.48/8.07  cnf(a5, assumption,
% 61.48/8.07  	or(not(X4),X5) = X10).
% 61.48/8.07  cnf(c18, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a5])], [c12, c17])).
% 61.48/8.07  cnf(c19, plain,
% 61.48/8.07  	~theorem(X9) | ~theorem(or(not(X9),X10)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a5])], [c12, c17])).
% 61.48/8.07  
% 61.48/8.07  cnf(c20, axiom,
% 61.48/8.07  	~axiom(X11) | theorem(X11)).
% 61.48/8.07  cnf(a6, assumption,
% 61.48/8.07  	X9 = X11).
% 61.48/8.07  cnf(c21, plain,
% 61.48/8.07  	~theorem(or(not(X9),X10)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 61.48/8.07  cnf(c22, plain,
% 61.48/8.07  	~axiom(X11),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 61.48/8.07  
% 61.48/8.07  cnf(c23, axiom,
% 61.48/8.07  	axiom(or(not(or(X12,X13)),or(X13,X12)))).
% 61.48/8.07  cnf(a7, assumption,
% 61.48/8.07  	X11 = or(not(or(X12,X13)),or(X13,X12))).
% 61.48/8.07  cnf(c24, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 61.48/8.07  cnf(c25, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 61.48/8.07  
% 61.48/8.07  cnf(c26, axiom,
% 61.48/8.07  	~axiom(X14) | theorem(X14)).
% 61.48/8.07  cnf(a8, assumption,
% 61.48/8.07  	or(not(X9),X10) = X14).
% 61.48/8.07  cnf(c27, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a8])], [c21, c26])).
% 61.48/8.07  cnf(c28, plain,
% 61.48/8.07  	~axiom(X14),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a8])], [c21, c26])).
% 61.48/8.07  
% 61.48/8.07  cnf(c29, axiom,
% 61.48/8.07  	axiom(or(not(or(not(X15),X16)),or(not(or(X17,X15)),or(X17,X16))))).
% 61.48/8.07  cnf(a9, assumption,
% 61.48/8.07  	X14 = or(not(or(not(X15),X16)),or(not(or(X17,X15)),or(X17,X16)))).
% 61.48/8.07  cnf(c30, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])).
% 61.48/8.07  cnf(c31, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a9])], [c28, c29])).
% 61.48/8.07  
% 61.48/8.07  cnf(c32, axiom,
% 61.48/8.07  	~axiom(X18) | theorem(X18)).
% 61.48/8.07  cnf(a10, assumption,
% 61.48/8.07  	or(not(X2),X3) = X18).
% 61.48/8.07  cnf(c33, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a10])], [c9, c32])).
% 61.48/8.07  cnf(c34, plain,
% 61.48/8.07  	~axiom(X18),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a10])], [c9, c32])).
% 61.48/8.07  
% 61.48/8.07  cnf(c35, axiom,
% 61.48/8.07  	axiom(or(not(or(X19,or(X20,X21))),or(X20,or(X19,X21))))).
% 61.48/8.07  cnf(a11, assumption,
% 61.48/8.07  	X18 = or(not(or(X19,or(X20,X21))),or(X20,or(X19,X21)))).
% 61.48/8.07  cnf(c36, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 61.48/8.07  cnf(c37, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 61.48/8.07  
% 61.48/8.07  cnf(c38, axiom,
% 61.48/8.07  	~theorem(X22) | ~theorem(or(not(X22),X23)) | theorem(X23)).
% 61.48/8.07  cnf(a12, assumption,
% 61.48/8.07  	or(not(X0),X1) = X23).
% 61.48/8.07  cnf(c39, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a12])], [c6, c38])).
% 61.48/8.07  cnf(c40, plain,
% 61.48/8.07  	~theorem(X22) | ~theorem(or(not(X22),X23)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a12])], [c6, c38])).
% 61.48/8.07  
% 61.48/8.07  cnf(c41, axiom,
% 61.48/8.07  	~axiom(X24) | theorem(X24)).
% 61.48/8.07  cnf(a13, assumption,
% 61.48/8.07  	X22 = X24).
% 61.48/8.07  cnf(c42, plain,
% 61.48/8.07  	~theorem(or(not(X22),X23)),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 61.48/8.07  cnf(c43, plain,
% 61.48/8.07  	~axiom(X24),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 61.48/8.07  
% 61.48/8.07  cnf(c44, axiom,
% 61.48/8.07  	axiom(or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26))))).
% 61.48/8.07  cnf(a14, assumption,
% 61.48/8.07  	X24 = or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26)))).
% 61.48/8.07  cnf(c45, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a14])], [c43, c44])).
% 61.48/8.07  cnf(c46, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a14])], [c43, c44])).
% 61.48/8.07  
% 61.48/8.07  cnf(c47, axiom,
% 61.48/8.07  	~axiom(X28) | theorem(X28)).
% 61.48/8.07  cnf(a15, assumption,
% 61.48/8.07  	or(not(X22),X23) = X28).
% 61.48/8.07  cnf(c48, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a15])], [c42, c47])).
% 61.48/8.07  cnf(c49, plain,
% 61.48/8.07  	~axiom(X28),
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a15])], [c42, c47])).
% 61.48/8.07  
% 61.48/8.07  cnf(c50, axiom,
% 61.48/8.07  	axiom(or(not(or(X29,or(X30,X31))),or(X30,or(X29,X31))))).
% 61.48/8.07  cnf(a16, assumption,
% 61.48/8.07  	X28 = or(not(or(X29,or(X30,X31))),or(X30,or(X29,X31)))).
% 61.48/8.07  cnf(c51, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a16])], [c49, c50])).
% 61.48/8.07  cnf(c52, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(strict_predicate_extension, [assumptions([a16])], [c49, c50])).
% 61.48/8.07  
% 61.48/8.07  cnf(c53, plain,
% 61.48/8.07  	$false,
% 61.48/8.07  	inference(constraint_solving, [
% 61.48/8.07  		bind(X0, or(X20,or(X19,X21))),
% 61.48/8.07  		bind(X1, or(not(or(not(or(not(p),q)),q)),or(p,q))),
% 61.48/8.07  		bind(X2, or(X17,X16)),
% 61.48/8.07  		bind(X3, or(X20,or(X19,X21))),
% 61.48/8.07  		bind(X4, or(not(X7),or(X8,X7))),
% 61.48/8.07  		bind(X5, or(X17,X16)),
% 61.48/8.07  		bind(X6, or(not(X7),or(X8,X7))),
% 61.48/8.07  		bind(X7, p),
% 61.48/8.07  		bind(X8, q),
% 61.48/8.07  		bind(X9, or(not(or(X12,X13)),or(X13,X12))),
% 61.48/8.07  		bind(X10, or(not(X4),X5)),
% 61.48/8.07  		bind(X11, or(not(or(X12,X13)),or(X13,X12))),
% 61.48/8.07  		bind(X12, q),
% 61.48/8.07  		bind(X13, p),
% 61.48/8.07  		bind(X14, or(not(X9),X10)),
% 61.48/8.07  		bind(X15, or(X12,X13)),
% 61.48/8.07  		bind(X16, or(X13,X12)),
% 61.48/8.07  		bind(X17, not(X7)),
% 61.48/8.07  		bind(X18, or(not(X2),X3)),
% 61.48/8.07  		bind(X19, not(X7)),
% 61.48/8.07  		bind(X20, p),
% 61.48/8.07  		bind(X21, q),
% 61.48/8.07  		bind(X22, or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26)))),
% 61.48/8.07  		bind(X23, or(not(X0),X1)),
% 61.48/8.07  		bind(X24, or(not(or(not(X25),X26)),or(not(or(X27,X25)),or(X27,X26)))),
% 61.48/8.07  		bind(X25, or(X19,X21)),
% 61.48/8.07  		bind(X26, q),
% 61.48/8.07  		bind(X27, p),
% 61.48/8.07  		bind(X28, or(not(X22),X23)),
% 61.48/8.07  		bind(X29, not(or(not(X25),X26))),
% 61.48/8.07  		bind(X30, not(or(X27,X25))),
% 61.48/8.07  		bind(X31, or(X27,X26))
% 61.48/8.07  	],
% 61.48/8.07  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 61.48/8.07  
% 61.48/8.07  % SZS output end IncompleteProof
%------------------------------------------------------------------------------