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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL076-3 : 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 : n018.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:42 EDT 2022

% Result   : Unsatisfiable 6.06s 1.09s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL076-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34  % Computer : n018.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jul  3 02:07:19 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 6.06/1.09  % SZS status Unsatisfiable
% 6.06/1.09  % SZS output begin IncompleteProof
% 6.06/1.09  cnf(c0, axiom,
% 6.06/1.09  	~is_a_theorem(implies(a,not(not(a))))).
% 6.06/1.09  cnf(c1, plain,
% 6.06/1.09  	~is_a_theorem(implies(a,not(not(a)))),
% 6.06/1.09  	inference(start, [], [c0])).
% 6.06/1.09  
% 6.06/1.09  cnf(c2, axiom,
% 6.06/1.09  	is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 6.06/1.09  cnf(a0, assumption,
% 6.06/1.09  	implies(a,not(not(a))) = X0).
% 6.06/1.09  cnf(c3, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 6.06/1.09  cnf(c4, plain,
% 6.06/1.09  	~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 6.06/1.09  
% 6.06/1.09  cnf(c5, axiom,
% 6.06/1.09  	is_a_theorem(implies(X2,implies(X3,X2)))).
% 6.06/1.09  cnf(a1, assumption,
% 6.06/1.09  	X1 = implies(X2,implies(X3,X2))).
% 6.06/1.09  cnf(c6, plain,
% 6.06/1.09  	~is_a_theorem(implies(X1,X0)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 6.06/1.09  cnf(c7, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 6.06/1.09  
% 6.06/1.09  cnf(c8, axiom,
% 6.06/1.09  	is_a_theorem(implies(X4,X5)) | ~is_a_theorem(implies(X6,X5)) | ~is_a_theorem(implies(X4,X6))).
% 6.06/1.09  cnf(a2, assumption,
% 6.06/1.09  	implies(X1,X0) = implies(X4,X5)).
% 6.06/1.09  cnf(c9, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 6.06/1.09  cnf(c10, plain,
% 6.06/1.09  	~is_a_theorem(implies(X6,X5)) | ~is_a_theorem(implies(X4,X6)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 6.06/1.09  
% 6.06/1.09  cnf(c11, axiom,
% 6.06/1.09  	is_a_theorem(implies(implies(not(X7),not(X8)),implies(X8,X7)))).
% 6.06/1.09  cnf(a3, assumption,
% 6.06/1.09  	implies(X6,X5) = implies(implies(not(X7),not(X8)),implies(X8,X7))).
% 6.06/1.09  cnf(c12, plain,
% 6.06/1.09  	~is_a_theorem(implies(X4,X6)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 6.06/1.09  cnf(c13, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 6.06/1.09  
% 6.06/1.09  cnf(c14, axiom,
% 6.06/1.09  	is_a_theorem(X9) | ~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9))).
% 6.06/1.09  cnf(a4, assumption,
% 6.06/1.09  	implies(X4,X6) = X9).
% 6.06/1.09  cnf(c15, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 6.06/1.09  cnf(c16, plain,
% 6.06/1.09  	~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 6.06/1.09  
% 6.06/1.09  cnf(c17, axiom,
% 6.06/1.09  	is_a_theorem(implies(X11,X12)) | ~is_a_theorem(implies(X13,X12)) | ~is_a_theorem(implies(X11,X13))).
% 6.06/1.09  cnf(a5, assumption,
% 6.06/1.09  	X10 = implies(X11,X12)).
% 6.06/1.09  cnf(c18, plain,
% 6.06/1.09  	~is_a_theorem(implies(X10,X9)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 6.06/1.09  cnf(c19, plain,
% 6.06/1.09  	~is_a_theorem(implies(X13,X12)) | ~is_a_theorem(implies(X11,X13)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 6.06/1.09  
% 6.06/1.09  cnf(c20, axiom,
% 6.06/1.09  	is_a_theorem(implies(implies(not(X14),not(X15)),implies(X15,X14)))).
% 6.06/1.09  cnf(a6, assumption,
% 6.06/1.09  	implies(X13,X12) = implies(implies(not(X14),not(X15)),implies(X15,X14))).
% 6.06/1.09  cnf(c21, plain,
% 6.06/1.09  	~is_a_theorem(implies(X11,X13)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 6.06/1.09  cnf(c22, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 6.06/1.09  
% 6.06/1.09  cnf(c23, axiom,
% 6.06/1.09  	is_a_theorem(implies(X16,X17)) | ~is_a_theorem(implies(X18,X17)) | ~is_a_theorem(implies(X16,X18))).
% 6.06/1.09  cnf(a7, assumption,
% 6.06/1.09  	implies(X11,X13) = implies(X16,X17)).
% 6.06/1.09  cnf(c24, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 6.06/1.09  cnf(c25, plain,
% 6.06/1.09  	~is_a_theorem(implies(X18,X17)) | ~is_a_theorem(implies(X16,X18)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 6.06/1.09  
% 6.06/1.09  cnf(c26, axiom,
% 6.06/1.09  	is_a_theorem(implies(implies(not(X19),not(X20)),implies(X20,X19)))).
% 6.06/1.09  cnf(a8, assumption,
% 6.06/1.09  	implies(X18,X17) = implies(implies(not(X19),not(X20)),implies(X20,X19))).
% 6.06/1.09  cnf(c27, plain,
% 6.06/1.09  	~is_a_theorem(implies(X16,X18)),
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 6.06/1.09  cnf(c28, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 6.06/1.09  
% 6.06/1.09  cnf(c29, axiom,
% 6.06/1.09  	is_a_theorem(implies(X21,implies(X22,X21)))).
% 6.06/1.09  cnf(a9, assumption,
% 6.06/1.09  	implies(X16,X18) = implies(X21,implies(X22,X21))).
% 6.06/1.09  cnf(c30, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])).
% 6.06/1.09  cnf(c31, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])).
% 6.06/1.09  
% 6.06/1.09  cnf(c32, axiom,
% 6.06/1.09  	is_a_theorem(implies(implies(X23,implies(X24,X25)),implies(implies(X23,X24),implies(X23,X25))))).
% 6.06/1.09  cnf(a10, assumption,
% 6.06/1.09  	implies(X10,X9) = implies(implies(X23,implies(X24,X25)),implies(implies(X23,X24),implies(X23,X25)))).
% 6.06/1.09  cnf(c33, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a10])], [c18, c32])).
% 6.06/1.09  cnf(c34, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(strict_predicate_extension, [assumptions([a10])], [c18, c32])).
% 6.06/1.09  
% 6.06/1.09  cnf(c35, plain,
% 6.06/1.09  	$false,
% 6.06/1.09  	inference(constraint_solving, [
% 6.06/1.09  		bind(X0, implies(a,not(not(a)))),
% 6.06/1.09  		bind(X1, implies(X2,implies(X3,X2))),
% 6.06/1.09  		bind(X2, not(X20)),
% 6.06/1.09  		bind(X3, X3),
% 6.06/1.09  		bind(X4, implies(X2,implies(X3,X2))),
% 6.06/1.09  		bind(X5, implies(a,not(not(a)))),
% 6.06/1.09  		bind(X6, implies(not(X7),not(X8))),
% 6.06/1.09  		bind(X7, not(not(a))),
% 6.06/1.09  		bind(X8, a),
% 6.06/1.09  		bind(X9, implies(X4,X6)),
% 6.06/1.09  		bind(X10, implies(X11,X12)),
% 6.06/1.09  		bind(X11, not(X20)),
% 6.06/1.09  		bind(X12, implies(X15,X14)),
% 6.06/1.09  		bind(X13, implies(not(X14),not(X15))),
% 6.06/1.09  		bind(X14, not(a)),
% 6.06/1.09  		bind(X15, implies(X3,X2)),
% 6.06/1.09  		bind(X16, not(X20)),
% 6.06/1.09  		bind(X17, implies(not(X14),not(X15))),
% 6.06/1.09  		bind(X18, implies(not(X19),not(X20))),
% 6.06/1.09  		bind(X19, not(X15)),
% 6.06/1.09  		bind(X20, not(X14)),
% 6.06/1.09  		bind(X21, not(X20)),
% 6.06/1.09  		bind(X22, not(X19)),
% 6.06/1.09  		bind(X23, not(X20)),
% 6.06/1.09  		bind(X24, implies(X3,X2)),
% 6.06/1.09  		bind(X25, not(a))
% 6.06/1.09  	],
% 6.06/1.09  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 6.06/1.09  
% 6.06/1.09  % SZS output end IncompleteProof
%------------------------------------------------------------------------------