TSTP Solution File: LCL153-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : LCL153-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% 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 : 300s
% DateTime : Tue Jul 26 07:06:17 EDT 2022
% Result : Unsatisfiable 1.50s 1.67s
% Output : CNFRefutation 1.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 8 RR)
% Number of literals : 34 ( 33 equ; 2 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 : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = implies(truth,X),
file('/tmp/MaedMax_18963') ).
cnf(eq_1,axiom,
truth = implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))),
file('/tmp/MaedMax_18963') ).
cnf(eq_2,axiom,
implies(implies(X,Y),Y) = implies(implies(Y,X),X),
file('/tmp/MaedMax_18963') ).
cnf(eq_3,axiom,
truth = implies(implies(not(X),not(Y)),implies(Y,X)),
file('/tmp/MaedMax_18963') ).
cnf(eq_4,axiom,
implies(not(X),Y) = or(X,Y),
file('/tmp/MaedMax_18963') ).
cnf(eq_5,axiom,
or(X,Y) = or(Y,X),
file('/tmp/MaedMax_18963') ).
cnf(eq_6,axiom,
not(or(not(X),not(Y))) = and(X,Y),
file('/tmp/MaedMax_18963') ).
cnf(eq_7,axiom,
or(and(X,not(Y)),and(not(X),Y)) = xor(X,Y),
file('/tmp/MaedMax_18963') ).
cnf(eq_8,axiom,
not(truth) = falsehood,
file('/tmp/MaedMax_18963') ).
cnf(eq_9,negated_conjecture,
not(x) != xor(x,truth),
file('/tmp/MaedMax_18963') ).
cnf(eq_10,plain,
implies(not(X),Y) = implies(not(Y),X),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_5,eq_4]),eq_4]) ).
cnf(eq_11,plain,
implies(X,implies(implies(X,x102),implies(truth,x102))) = truth,
inference(cp,[status(thm)],[eq_0,eq_1]) ).
cnf(eq_12,plain,
implies(implies(not(x100),falsehood),implies(truth,x100)) = truth,
inference(cp,[status(thm)],[eq_8,eq_3]) ).
cnf(eq_13,plain,
implies(X,X) = implies(implies(X,truth),truth),
inference(cp,[status(thm)],[eq_0,eq_2]) ).
cnf(eq_14,plain,
truth = implies(X,implies(implies(X,Y),Y)),
inference(rw,[status(thm)],[eq_11,eq_0]) ).
cnf(eq_15,plain,
truth = implies(implies(not(X),falsehood),X),
inference(rw,[status(thm)],[eq_12,eq_0]) ).
cnf(eq_16,plain,
truth = implies(implies(truth,Y),Y),
inference(cp,[status(thm)],[eq_14,eq_0]) ).
cnf(eq_17,plain,
implies(X,implies(X,X)) = truth,
inference(cp,[status(thm)],[eq_13,eq_14]) ).
cnf(eq_18,plain,
truth = implies(X,X),
inference(rw,[status(thm)],[eq_16,eq_0]) ).
cnf(eq_19,plain,
truth = implies(X,implies(X,X)),
eq_17 ).
cnf(eq_20,plain,
truth = implies(X,truth),
inference(rw,[status(thm)],[eq_19,eq_18]) ).
cnf(eq_21,plain,
implies(not(not(X)),X) = truth,
inference(cp,[status(thm)],[eq_10,eq_18]) ).
cnf(eq_22,plain,
implies(truth,implies(x101,not(not(x101)))) = truth,
inference(cp,[status(thm)],[eq_21,eq_3]) ).
cnf(eq_23,plain,
implies(truth,not(falsehood)) = truth,
inference(cp,[status(thm)],[eq_21,eq_15]) ).
cnf(eq_24,plain,
implies(truth,X) = implies(implies(X,not(not(X))),not(not(X))),
inference(cp,[status(thm)],[eq_21,eq_2]) ).
cnf(eq_25,plain,
truth = not(falsehood),
inference(rw,[status(thm)],[eq_23,eq_0]) ).
cnf(eq_26,plain,
truth = implies(X,not(not(X))),
inference(rw,[status(thm)],[eq_22,eq_0]) ).
cnf(eq_27,plain,
X = implies(not(falsehood),X),
inference(rw,[status(thm)],[eq_0,eq_25]) ).
cnf(eq_28,plain,
X = not(not(X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_24,eq_0]),eq_26]),eq_0]) ).
cnf(eq_29,plain,
and(X,Y) = not(implies(X,not(Y))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_6,eq_4]),eq_28]) ).
cnf(eq_30,plain,
implies(implies(X,Y),not(implies(not(X),not(Y)))) = xor(X,Y),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_7,eq_29]),eq_29]),eq_28]),eq_4]),eq_28]) ).
cnf(eq_31,plain,
X = implies(not(X),falsehood),
inference(cp,[status(thm)],[eq_27,eq_10]) ).
cnf(eq_32,negated_conjecture,
not(x) != not(x),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_9,eq_30]),eq_20]),eq_8]),eq_31]),eq_0]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL153-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n012.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 : 300
% 0.12/0.33 % DateTime : Tue Jul 26 05:27:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.50/1.67 % SZS status Unsatisfiable
% 1.50/1.67 % SZS output start CNFRefutation for /tmp/MaedMax_18963
% See solution above
% 1.50/1.67
%------------------------------------------------------------------------------