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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL191-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 : 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 : Sun Jul 17 12:07:31 EDT 2022

% Result   : Unsatisfiable 40.14s 5.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

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