TSTP Solution File: LCL114-2 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n020.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 : 300s
% DateTime : Tue Jul 26 07:06:14 EDT 2022
% Result : Unsatisfiable 1.14s 1.30s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 6 RR)
% Number of literals : 37 ( 36 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = implies(truth,X),
file('/tmp/MaedMax_19970') ).
cnf(eq_1,axiom,
truth = implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),
file('/tmp/MaedMax_19970') ).
cnf(eq_2,axiom,
implies(implies(X,Y),Y) = implies(implies(Y,X),X),
file('/tmp/MaedMax_19970') ).
cnf(eq_3,axiom,
truth = implies(implies(not(X),not(Y)),implies(Y,X)),
file('/tmp/MaedMax_19970') ).
cnf(eq_4,negated_conjecture,
truth != implies(implies(x,y),implies(not(y),not(x))),
file('/tmp/MaedMax_19970') ).
cnf(eq_5,plain,
implies(X,implies(implies(X,x102),implies(truth,x102))) = truth,
inference(cp,[status(thm)],[eq_0,eq_1]) ).
cnf(eq_6,plain,
implies(implies(x100,truth),implies(X,implies(x100,X))) = truth,
inference(cp,[status(thm)],[eq_0,eq_1]) ).
cnf(eq_7,plain,
implies(implies(not(X),not(truth)),X) = truth,
inference(cp,[status(thm)],[eq_0,eq_3]) ).
cnf(eq_8,plain,
implies(X,X) = implies(implies(X,truth),truth),
inference(cp,[status(thm)],[eq_0,eq_2]) ).
cnf(eq_9,plain,
truth = implies(X,implies(implies(X,Y),Y)),
inference(rw,[status(thm)],[eq_5,eq_0]) ).
cnf(eq_10,plain,
truth = implies(implies(X,truth),implies(Y,implies(X,Y))),
eq_6 ).
cnf(eq_11,plain,
implies(X,implies(X,X)) = truth,
inference(cp,[status(thm)],[eq_8,eq_9]) ).
cnf(eq_12,plain,
implies(implies(implies(truth,truth),truth),implies(x101,implies(truth,x101))) = truth,
inference(cp,[status(thm)],[eq_8,eq_10]) ).
cnf(eq_13,plain,
truth = implies(X,X),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_12,eq_0]),eq_0]),eq_0]),eq_0]) ).
cnf(eq_14,plain,
truth = implies(X,implies(X,X)),
eq_11 ).
cnf(eq_15,plain,
truth = implies(X,truth),
inference(rw,[status(thm)],[eq_14,eq_13]) ).
cnf(eq_16,plain,
implies(truth,implies(x101,implies(X,x101))) = truth,
inference(cp,[status(thm)],[eq_15,eq_10]) ).
cnf(eq_17,plain,
truth = implies(X,implies(Y,X)),
inference(rw,[status(thm)],[eq_16,eq_0]) ).
cnf(eq_18,plain,
implies(truth,implies(implies(implies(Y,X),x102),implies(X,x102))) = truth,
inference(cp,[status(thm)],[eq_17,eq_1]) ).
cnf(eq_19,plain,
truth = implies(implies(implies(X,Y),Z),implies(Y,Z)),
inference(rw,[status(thm)],[eq_18,eq_0]) ).
cnf(eq_20,plain,
implies(truth,implies(not(Y),implies(Y,X))) = truth,
inference(cp,[status(thm)],[eq_3,eq_19]) ).
cnf(eq_21,plain,
implies(truth,implies(not(truth),X)) = truth,
inference(cp,[status(thm)],[eq_7,eq_19]) ).
cnf(eq_22,plain,
truth = implies(not(X),implies(X,Y)),
inference(rw,[status(thm)],[eq_20,eq_0]) ).
cnf(eq_23,plain,
truth = implies(not(truth),X),
inference(rw,[status(thm)],[eq_21,eq_0]) ).
cnf(eq_24,plain,
implies(truth,X) = implies(implies(X,not(truth)),not(truth)),
inference(cp,[status(thm)],[eq_23,eq_2]) ).
cnf(eq_25,plain,
X = implies(implies(X,not(truth)),not(truth)),
inference(rw,[status(thm)],[eq_24,eq_0]) ).
cnf(eq_26,plain,
implies(not(implies(X,not(truth))),X) = truth,
inference(cp,[status(thm)],[eq_25,eq_22]) ).
cnf(eq_27,plain,
implies(truth,implies(x101,implies(not(x101),not(truth)))) = truth,
inference(cp,[status(thm)],[eq_26,eq_3]) ).
cnf(eq_28,plain,
truth = implies(X,implies(not(X),not(truth))),
inference(rw,[status(thm)],[eq_27,eq_0]) ).
cnf(eq_29,plain,
implies(truth,implies(not(X),not(truth))) = implies(implies(implies(not(X),not(truth)),X),X),
inference(cp,[status(thm)],[eq_28,eq_2]) ).
cnf(eq_30,plain,
X = implies(not(X),not(truth)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_29,eq_0]),eq_7]),eq_0]) ).
cnf(eq_31,plain,
implies(X,not(truth)) = not(X),
inference(cp,[status(thm)],[eq_30,eq_25]) ).
cnf(eq_32,plain,
implies(implies(X,x101),implies(implies(x101,not(truth)),not(X))) = truth,
inference(cp,[status(thm)],[eq_31,eq_1]) ).
cnf(eq_33,plain,
truth = implies(implies(X,Y),implies(not(Y),not(X))),
inference(rw,[status(thm)],[eq_32,eq_31]) ).
cnf(eq_34,negated_conjecture,
implies(implies(X,Y),implies(not(Y),not(X))) != implies(implies(x,y),implies(not(y),not(x))),
inference(cp,[status(thm)],[eq_33,eq_4]) ).
cnf(eq_35,negated_conjecture,
implies(implies(X,Y),implies(not(Y),not(X))) != implies(implies(X,Y),implies(not(Y),not(X))),
eq_34 ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run_maedmax %d %s
% 0.14/0.34 % Computer : n020.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 : 300
% 0.14/0.34 % DateTime : Tue Jul 26 05:27:39 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.14/1.30 % SZS status Unsatisfiable
% 1.14/1.30 % SZS output start CNFRefutation for /tmp/MaedMax_19970
% See solution above
% 1.14/1.30
%------------------------------------------------------------------------------