TSTP Solution File: LDA002-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n023.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:07:40 EDT 2022
% Result : Unsatisfiable 221.81s 222.03s
% Output : CNFRefutation 221.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 36 RR)
% Number of literals : 47 ( 46 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 14 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)),
file('/tmp/MaedMax_3383') ).
cnf(eq_1,axiom,
f(n1,n1) = n2,
file('/tmp/MaedMax_3383') ).
cnf(eq_2,axiom,
f(n2,n1) = n3,
file('/tmp/MaedMax_3383') ).
cnf(eq_3,axiom,
f(n2,n2) = u,
file('/tmp/MaedMax_3383') ).
cnf(eq_4,axiom,
f(u,n1) = u1,
file('/tmp/MaedMax_3383') ).
cnf(eq_5,axiom,
f(u,n2) = u2,
file('/tmp/MaedMax_3383') ).
cnf(eq_6,axiom,
f(u,n3) = u3,
file('/tmp/MaedMax_3383') ).
cnf(eq_7,axiom,
f(u,u) = uu,
file('/tmp/MaedMax_3383') ).
cnf(eq_8,axiom,
f(f(n3,n2),u2) = a,
file('/tmp/MaedMax_3383') ).
cnf(eq_9,axiom,
f(u1,u3) = b,
file('/tmp/MaedMax_3383') ).
cnf(eq_10,axiom,
f(uu,uu) = v,
file('/tmp/MaedMax_3383') ).
cnf(eq_11,negated_conjecture,
f(a,v) != f(b,v),
file('/tmp/MaedMax_3383') ).
cnf(eq_12,plain,
u = f(n1,f(n1,n1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_3,eq_1]),eq_1]),eq_0]) ).
cnf(eq_13,plain,
u2 = f(n1,f(f(n1,n1),n1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_5,eq_3]),eq_1]),eq_1]),eq_1]),eq_0]),eq_0]) ).
cnf(eq_14,plain,
uu = f(n1,f(n1,f(n1,n1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_7,eq_3]),eq_3]),eq_1]),eq_1]),eq_1]),eq_1]),eq_0]),eq_0]),eq_0]),eq_0]) ).
cnf(eq_15,plain,
f(f(n1,f(n1,n1)),n3) = u3,
inference(rw,[status(thm)],[eq_6,eq_12]) ).
cnf(eq_16,plain,
f(f(n1,n1),n1) = n3,
inference(rw,[status(thm)],[eq_2,eq_1]) ).
cnf(eq_17,plain,
f(n1,f(n1,f(n1,f(n1,n1)))) = v,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_10,eq_14]),eq_14]),eq_0]),eq_0]),eq_0]) ).
cnf(eq_18,plain,
f(n3,f(n2,x102)) = f(n2,f(n1,x102)),
inference(cp,[status(thm)],[eq_2,eq_0]) ).
cnf(eq_19,plain,
f(f(X,f(Y,Z)),f(f(X,Y),x102)) = f(f(X,Y),f(f(X,Z),x102)),
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_20,plain,
f(f(n2,x101),n3) = f(n2,f(x101,n1)),
inference(cp,[status(thm)],[eq_2,eq_0]) ).
cnf(eq_21,plain,
f(f(f(X,Y),x101),f(X,f(Y,Z))) = f(f(X,Y),f(x101,f(X,Z))),
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_22,plain,
f(f(u,n1),u3) = b,
inference(cp,[status(thm)],[eq_4,eq_9]) ).
cnf(eq_23,plain,
f(f(X,Y),f(Z,f(X,x3))) = f(f(f(X,Y),Z),f(X,f(Y,x3))),
eq_21 ).
cnf(eq_24,plain,
f(n1,f(n1,X)) = f(n3,f(f(n1,n1),X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_18,eq_1]),eq_1]),eq_0]) ).
cnf(eq_25,plain,
f(f(X,Y),f(f(X,Z),x3)) = f(f(X,f(Y,Z)),f(f(X,Y),x3)),
eq_19 ).
cnf(eq_26,plain,
f(f(f(f(X,Y),X),x102),f(X,f(Y,Z))) = f(f(f(X,Y),X),f(x102,f(f(X,Y),Z))),
inference(cp,[status(thm)],[eq_0,eq_23]) ).
cnf(eq_27,plain,
f(f(n1,f(n1,n1)),f(f(n1,n1),n1)) = u3,
inference(cp,[status(thm)],[eq_16,eq_15]) ).
cnf(eq_28,plain,
f(n3,n3) = f(n1,f(n1,n1)),
inference(cp,[status(thm)],[eq_16,eq_24]) ).
cnf(eq_29,plain,
f(f(f(X,Y),X),f(Z,f(f(X,Y),x3))) = f(f(f(f(X,Y),X),Z),f(X,f(Y,x3))),
eq_26 ).
cnf(eq_30,plain,
f(n1,f(n1,n1)) = f(n3,n3),
eq_28 ).
cnf(eq_31,negated_conjecture,
f(a,f(n1,f(n1,f(n1,f(n1,n1))))) != f(b,v),
inference(cp,[status(thm)],[eq_17,eq_11]) ).
cnf(eq_32,plain,
f(n2,n2) = f(n1,n2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_30,eq_1]),eq_2]),eq_2]),eq_0]),eq_1]) ).
cnf(eq_33,plain,
u3 = f(f(n1,n1),f(f(n1,n1),n1)),
inference(cp,[status(thm)],[eq_27,eq_25]) ).
cnf(eq_34,plain,
f(n1,n2) = u,
inference(rw,[status(thm)],[eq_32,eq_3]) ).
cnf(eq_35,plain,
f(f(f(f(n1,n1),n1),f(n1,n1)),f(n1,f(f(n1,n1),n1))) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_8,eq_16]),eq_1]),eq_13]) ).
cnf(eq_36,plain,
f(f(n2,X),n3) = f(n2,f(X,n1)),
eq_20 ).
cnf(eq_37,plain,
f(n1,f(f(n1,n1),f(f(n1,n1),n1))) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_22,eq_12]),eq_27]),eq_0]),eq_0]) ).
cnf(eq_38,plain,
f(f(n1,n2),n3) = f(n2,f(n2,n1)),
inference(cp,[status(thm)],[eq_32,eq_36]) ).
cnf(eq_39,plain,
f(n2,n3) = u3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_38,eq_34]),eq_6]),eq_2]) ).
cnf(eq_40,plain,
f(n1,u3) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_37,eq_1]),eq_1]),eq_2]),eq_39]) ).
cnf(eq_41,plain,
f(f(f(f(f(X,Y),X),f(X,Y)),x102),f(X,f(Y,Z))) = f(f(f(f(X,Y),X),f(X,Y)),f(x102,f(f(f(X,Y),X),Z))),
inference(cp,[status(thm)],[eq_0,eq_29]) ).
cnf(eq_42,plain,
f(f(f(f(X,Y),X),f(X,Y)),f(Z,f(f(f(X,Y),X),x3))) = f(f(f(f(f(X,Y),X),f(X,Y)),Z),f(X,f(Y,x3))),
eq_41 ).
cnf(eq_43,negated_conjecture,
f(f(f(f(f(n1,n1),n1),f(n1,n1)),f(n1,f(f(n1,n1),n1))),f(n1,f(n1,f(n1,f(n1,n1))))) != f(n1,f(u3,f(n1,f(n1,f(n1,n1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_31,eq_35]),eq_40]),eq_17]),eq_0]) ).
cnf(eq_44,negated_conjecture,
f(f(f(f(n1,n1),n1),f(n1,n1)),f(f(n1,f(f(n1,n1),n1)),f(f(f(n1,n1),n1),f(n1,f(n1,n1))))) != f(n1,f(u3,f(n1,f(n1,f(n1,n1))))),
inference(cp,[status(thm)],[eq_42,eq_43]) ).
cnf(eq_45,negated_conjecture,
f(n1,f(n1,f(n1,f(n1,f(n1,n1))))) != f(n1,f(n1,f(n1,f(n1,f(n1,n1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_44,eq_23]),eq_0]),eq_0]),eq_23]),eq_0]),eq_29]),eq_0]),eq_0]),eq_23]),eq_0]),eq_33]),eq_23]),eq_23]),eq_0]),eq_0]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n023.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 03:02:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 221.81/222.03 % SZS status Unsatisfiable
% 221.81/222.03 % SZS output start CNFRefutation for /tmp/MaedMax_3383
% See solution above
% 221.81/222.03
%------------------------------------------------------------------------------