TSTP Solution File: LCL161-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : LCL161-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n009.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 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 7 RR)
% Number of literals : 22 ( 21 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
not(X) = xor(X,truth),
file('/tmp/MaedMax_30470') ).
cnf(eq_1,axiom,
X = xor(X,falsehood),
file('/tmp/MaedMax_30470') ).
cnf(eq_2,axiom,
X = and_star(X,truth),
file('/tmp/MaedMax_30470') ).
cnf(eq_3,axiom,
xor(X,xor(truth,Y)) = xor(xor(X,truth),Y),
file('/tmp/MaedMax_30470') ).
cnf(eq_4,axiom,
xor(X,Y) = xor(Y,X),
file('/tmp/MaedMax_30470') ).
cnf(eq_5,axiom,
and_star(X,Y) = and_star(Y,X),
file('/tmp/MaedMax_30470') ).
cnf(eq_6,axiom,
not(truth) = falsehood,
file('/tmp/MaedMax_30470') ).
cnf(eq_7,axiom,
xor(truth,and_star(X,xor(truth,Y))) = implies(X,Y),
file('/tmp/MaedMax_30470') ).
cnf(eq_8,negated_conjecture,
implies(truth,x) != x,
file('/tmp/MaedMax_30470') ).
cnf(eq_9,plain,
xor(X,xor(truth,Y)) = xor(not(X),Y),
inference(rw,[status(thm)],[eq_3,eq_0]) ).
cnf(eq_10,plain,
X = xor(X,not(truth)),
inference(rw,[status(thm)],[eq_1,eq_6]) ).
cnf(eq_11,plain,
and_star(truth,X) = X,
inference(cp,[status(thm)],[eq_5,eq_2]) ).
cnf(eq_12,plain,
xor(x100,xor(X,truth)) = xor(not(x100),X),
inference(cp,[status(thm)],[eq_4,eq_9]) ).
cnf(eq_13,plain,
not(X) = xor(truth,X),
inference(cp,[status(thm)],[eq_0,eq_4]) ).
cnf(eq_14,plain,
xor(X,not(Y)) = xor(not(X),Y),
inference(rw,[status(thm)],[eq_12,eq_0]) ).
cnf(eq_15,negated_conjecture,
xor(truth,and_star(truth,xor(truth,x))) != x,
inference(rw,[status(thm)],[eq_8,eq_7]) ).
cnf(eq_16,negated_conjecture,
xor(truth,xor(truth,x)) != x,
inference(cp,[status(thm)],[eq_11,eq_15]) ).
cnf(eq_17,negated_conjecture,
not(not(x)) != x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_16,eq_13]),eq_13]) ).
cnf(eq_18,plain,
X = xor(not(X),truth),
inference(cp,[status(thm)],[eq_10,eq_14]) ).
cnf(eq_19,plain,
X = not(not(X)),
inference(rw,[status(thm)],[eq_18,eq_0]) ).
cnf(eq_20,negated_conjecture,
x != x,
inference(cp,[status(thm)],[eq_19,eq_17]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL161-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n009.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 : 300
% 0.13/0.34 % DateTime : Tue Jul 26 05:29:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.56 % SZS status Unsatisfiable
% 0.19/0.56 % SZS output start CNFRefutation for /tmp/MaedMax_30470
% See solution above
% 0.19/0.56
%------------------------------------------------------------------------------