TSTP Solution File: LCL102-1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL102-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n012.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:06:51 EDT 2022

% Result   : Unsatisfiable 97.97s 12.64s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL102-1 : TPTP v8.1.0. Released v1.0.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.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul  4 14:20:31 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 97.97/12.64  % SZS status Unsatisfiable
% 97.97/12.64  % SZS output begin IncompleteProof
% 97.97/12.64  cnf(c0, axiom,
% 97.97/12.64  	~is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c))))).
% 97.97/12.64  cnf(c1, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
% 97.97/12.64  	inference(start, [], [c0])).
% 97.97/12.64  
% 97.97/12.64  cnf(c2, axiom,
% 97.97/12.64  	is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0))).
% 97.97/12.64  cnf(a0, assumption,
% 97.97/12.64  	equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c))) = X0).
% 97.97/12.64  cnf(c3, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 97.97/12.64  cnf(c4, plain,
% 97.97/12.64  	~is_a_theorem(X1) | ~is_a_theorem(equivalent(X1,X0)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 97.97/12.64  
% 97.97/12.64  cnf(c5, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X2),equivalent(X4,X3))))).
% 97.97/12.64  cnf(a1, assumption,
% 97.97/12.64  	X1 = equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X2),equivalent(X4,X3)))).
% 97.97/12.64  cnf(c6, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(X1,X0)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 97.97/12.64  cnf(c7, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 97.97/12.64  
% 97.97/12.64  cnf(c8, axiom,
% 97.97/12.64  	is_a_theorem(X5) | ~is_a_theorem(X6) | ~is_a_theorem(equivalent(X6,X5))).
% 97.97/12.64  cnf(a2, assumption,
% 97.97/12.64  	equivalent(X1,X0) = X5).
% 97.97/12.64  cnf(c9, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 97.97/12.64  cnf(c10, plain,
% 97.97/12.64  	~is_a_theorem(X6) | ~is_a_theorem(equivalent(X6,X5)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 97.97/12.64  
% 97.97/12.64  cnf(c11, axiom,
% 97.97/12.64  	is_a_theorem(X7) | ~is_a_theorem(X8) | ~is_a_theorem(equivalent(X8,X7))).
% 97.97/12.64  cnf(a3, assumption,
% 97.97/12.64  	X6 = X7).
% 97.97/12.64  cnf(c12, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(X6,X5)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 97.97/12.64  cnf(c13, plain,
% 97.97/12.64  	~is_a_theorem(X8) | ~is_a_theorem(equivalent(X8,X7)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 97.97/12.64  
% 97.97/12.64  cnf(c14, axiom,
% 97.97/12.64  	is_a_theorem(X9) | ~is_a_theorem(X10) | ~is_a_theorem(equivalent(X10,X9))).
% 97.97/12.64  cnf(a4, assumption,
% 97.97/12.64  	X8 = X9).
% 97.97/12.64  cnf(c15, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(X8,X7)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 97.97/12.64  cnf(c16, plain,
% 97.97/12.64  	~is_a_theorem(X10) | ~is_a_theorem(equivalent(X10,X9)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 97.97/12.64  
% 97.97/12.64  cnf(c17, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X11,X12),equivalent(X11,X13)),equivalent(X12,X13)),X14),X14))).
% 97.97/12.64  cnf(a5, assumption,
% 97.97/12.64  	X10 = equivalent(equivalent(equivalent(equivalent(equivalent(X11,X12),equivalent(X11,X13)),equivalent(X12,X13)),X14),X14)).
% 97.97/12.64  cnf(c18, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(X10,X9)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 97.97/12.64  cnf(c19, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 97.97/12.64  
% 97.97/12.64  cnf(c20, axiom,
% 97.97/12.64  	is_a_theorem(X15) | ~is_a_theorem(X16) | ~is_a_theorem(equivalent(X16,X15))).
% 97.97/12.64  cnf(a6, assumption,
% 97.97/12.64  	equivalent(X10,X9) = X15).
% 97.97/12.64  cnf(c21, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 97.97/12.64  cnf(c22, plain,
% 97.97/12.64  	~is_a_theorem(X16) | ~is_a_theorem(equivalent(X16,X15)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 97.97/12.64  
% 97.97/12.64  cnf(c23, axiom,
% 97.97/12.64  	is_a_theorem(X17) | ~is_a_theorem(X18) | ~is_a_theorem(equivalent(X18,X17))).
% 97.97/12.64  cnf(a7, assumption,
% 97.97/12.64  	X16 = X17).
% 97.97/12.64  cnf(c24, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(X16,X15)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 97.97/12.64  cnf(c25, plain,
% 97.97/12.64  	~is_a_theorem(X18) | ~is_a_theorem(equivalent(X18,X17)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 97.97/12.64  
% 97.97/12.64  cnf(c26, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(X19,equivalent(equivalent(X20,X21),equivalent(equivalent(X21,X20),X19))))).
% 97.97/12.64  cnf(a8, assumption,
% 97.97/12.64  	X18 = equivalent(X19,equivalent(equivalent(X20,X21),equivalent(equivalent(X21,X20),X19)))).
% 97.97/12.64  cnf(c27, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(X18,X17)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 97.97/12.64  cnf(c28, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 97.97/12.64  
% 97.97/12.64  cnf(c29, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(equivalent(X22,X23),equivalent(equivalent(X24,X22),equivalent(X24,X23))))).
% 97.97/12.64  cnf(a9, assumption,
% 97.97/12.64  	equivalent(X18,X17) = equivalent(equivalent(X22,X23),equivalent(equivalent(X24,X22),equivalent(X24,X23)))).
% 97.97/12.64  cnf(c30, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])).
% 97.97/12.64  cnf(c31, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])).
% 97.97/12.64  
% 97.97/12.64  cnf(c32, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(equivalent(X25,X26),equivalent(equivalent(X27,X25),equivalent(X27,X26))))).
% 97.97/12.64  cnf(a10, assumption,
% 97.97/12.64  	equivalent(X16,X15) = equivalent(equivalent(X25,X26),equivalent(equivalent(X27,X25),equivalent(X27,X26)))).
% 97.97/12.64  cnf(c33, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a10])], [c24, c32])).
% 97.97/12.64  cnf(c34, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a10])], [c24, c32])).
% 97.97/12.64  
% 97.97/12.64  cnf(c35, axiom,
% 97.97/12.64  	is_a_theorem(X28) | ~is_a_theorem(X29) | ~is_a_theorem(equivalent(X29,X28))).
% 97.97/12.64  cnf(a11, assumption,
% 97.97/12.64  	equivalent(X8,X7) = X28).
% 97.97/12.64  cnf(c36, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a11])], [c15, c35])).
% 97.97/12.64  cnf(c37, plain,
% 97.97/12.64  	~is_a_theorem(X29) | ~is_a_theorem(equivalent(X29,X28)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a11])], [c15, c35])).
% 97.97/12.64  
% 97.97/12.64  cnf(c38, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(equivalent(X30,X31),equivalent(equivalent(X32,X30),equivalent(X32,X31))))).
% 97.97/12.64  cnf(a12, assumption,
% 97.97/12.64  	X29 = equivalent(equivalent(X30,X31),equivalent(equivalent(X32,X30),equivalent(X32,X31)))).
% 97.97/12.64  cnf(c39, plain,
% 97.97/12.64  	~is_a_theorem(equivalent(X29,X28)),
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a12])], [c37, c38])).
% 97.97/12.64  cnf(c40, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a12])], [c37, c38])).
% 97.97/12.64  
% 97.97/12.64  cnf(c41, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X33,X34),equivalent(X33,X35)),equivalent(X34,X35)),X36),X36))).
% 97.97/12.64  cnf(a13, assumption,
% 97.97/12.64  	equivalent(X29,X28) = equivalent(equivalent(equivalent(equivalent(equivalent(X33,X34),equivalent(X33,X35)),equivalent(X34,X35)),X36),X36)).
% 97.97/12.64  cnf(c42, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a13])], [c39, c41])).
% 97.97/12.64  cnf(c43, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a13])], [c39, c41])).
% 97.97/12.64  
% 97.97/12.64  cnf(c44, axiom,
% 97.97/12.64  	is_a_theorem(equivalent(equivalent(X37,X38),equivalent(equivalent(X39,X37),equivalent(X39,X38))))).
% 97.97/12.64  cnf(a14, assumption,
% 97.97/12.64  	equivalent(X6,X5) = equivalent(equivalent(X37,X38),equivalent(equivalent(X39,X37),equivalent(X39,X38)))).
% 97.97/12.64  cnf(c45, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a14])], [c12, c44])).
% 97.97/12.64  cnf(c46, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(strict_predicate_extension, [assumptions([a14])], [c12, c44])).
% 97.97/12.64  
% 97.97/12.64  cnf(c47, plain,
% 97.97/12.64  	$false,
% 97.97/12.64  	inference(constraint_solving, [
% 97.97/12.64  		bind(X0, equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
% 97.97/12.64  		bind(X1, equivalent(equivalent(X2,X3),equivalent(equivalent(X4,X2),equivalent(X4,X3)))),
% 97.97/12.64  		bind(X2, equivalent(X12,X13)),
% 97.97/12.64  		bind(X3, c),
% 97.97/12.64  		bind(X4, equivalent(equivalent(X11,X12),equivalent(X11,X13))),
% 97.97/12.64  		bind(X5, equivalent(X1,X0)),
% 97.97/12.64  		bind(X6, equivalent(X32,X31)),
% 97.97/12.64  		bind(X7, equivalent(X32,X31)),
% 97.97/12.64  		bind(X8, equivalent(X27,X26)),
% 97.97/12.64  		bind(X9, equivalent(X27,X26)),
% 97.97/12.64  		bind(X10, equivalent(equivalent(equivalent(equivalent(equivalent(X11,X12),equivalent(X11,X13)),equivalent(X12,X13)),X14),X14)),
% 97.97/12.64  		bind(X11, e),
% 97.97/12.64  		bind(X12, a),
% 97.97/12.64  		bind(X13, b),
% 97.97/12.64  		bind(X14, equivalent(X24,X22)),
% 97.97/12.64  		bind(X15, equivalent(X10,X9)),
% 97.97/12.64  		bind(X16, equivalent(equivalent(X24,X22),equivalent(X24,X23))),
% 97.97/12.64  		bind(X17, equivalent(equivalent(X24,X22),equivalent(X24,X23))),
% 97.97/12.64  		bind(X18, equivalent(X19,equivalent(equivalent(X20,X21),equivalent(equivalent(X21,X20),X19)))),
% 97.97/12.64  		bind(X19, c),
% 97.97/12.64  		bind(X20, e),
% 97.97/12.64  		bind(X21, a),
% 97.97/12.64  		bind(X22, c),
% 97.97/12.64  		bind(X23, equivalent(equivalent(X20,X21),equivalent(equivalent(X21,X20),X19))),
% 97.97/12.64  		bind(X24, equivalent(X33,X34)),
% 97.97/12.64  		bind(X25, equivalent(X24,X22)),
% 97.97/12.64  		bind(X26, equivalent(X24,X23)),
% 97.97/12.64  		bind(X27, equivalent(equivalent(equivalent(equivalent(X11,X12),equivalent(X11,X13)),equivalent(X12,X13)),X14)),
% 97.97/12.64  		bind(X28, equivalent(X8,X7)),
% 97.97/12.64  		bind(X29, equivalent(equivalent(X30,X31),equivalent(equivalent(X32,X30),equivalent(X32,X31)))),
% 97.97/12.64  		bind(X30, equivalent(equivalent(X33,X34),equivalent(X33,X35))),
% 97.97/12.64  		bind(X31, equivalent(X34,X35)),
% 97.97/12.64  		bind(X32, equivalent(equivalent(equivalent(equivalent(X11,X12),equivalent(X11,X13)),equivalent(X12,X13)),X14)),
% 97.97/12.64  		bind(X33, equivalent(X20,X21)),
% 97.97/12.64  		bind(X34, equivalent(X11,X13)),
% 97.97/12.64  		bind(X35, equivalent(equivalent(X21,X20),X19)),
% 97.97/12.64  		bind(X36, equivalent(equivalent(X32,X30),equivalent(X32,X31))),
% 97.97/12.64  		bind(X37, equivalent(equivalent(equivalent(equivalent(X11,X12),equivalent(X11,X13)),equivalent(X12,X13)),X14)),
% 97.97/12.64  		bind(X38, equivalent(X34,X35)),
% 97.97/12.64  		bind(X39, equivalent(X2,X3))
% 97.97/12.64  	],
% 97.97/12.64  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 97.97/12.64  
% 97.97/12.64  % SZS output end IncompleteProof
%------------------------------------------------------------------------------