TSTP Solution File: LAT394-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n011.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:07 EDT 2022
% Result : Unsatisfiable 3.77s 3.96s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 5
% Syntax : Number of clauses : 93 ( 93 unt; 0 nHn; 12 RR)
% Number of literals : 93 ( 92 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 148 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = f(f(f(f(B,A),f(A,C)),D),f(A,f(f(A,f(f(B,B),B)),C))),
file('/tmp/MaedMax_12560') ).
cnf(eq_1,axiom,
f(f(A,A),f(B,B)) = or(A,B),
file('/tmp/MaedMax_12560') ).
cnf(eq_2,axiom,
f(f(A,B),f(A,B)) = and(A,B),
file('/tmp/MaedMax_12560') ).
cnf(eq_3,axiom,
f(A,A) = neg(A),
file('/tmp/MaedMax_12560') ).
cnf(eq_4,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/tmp/MaedMax_12560') ).
cnf(eq_5,plain,
A = f(f(f(f(B,A),f(A,C)),D),f(A,f(f(A,f(neg(B),B)),C))),
inference(rw,[status(thm)],[eq_0,eq_3]) ).
cnf(eq_6,plain,
and(A,B) = neg(f(A,B)),
inference(rw,[status(thm)],[eq_2,eq_3]) ).
cnf(eq_7,plain,
f(neg(A),neg(B)) = or(A,B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_1,eq_3]),eq_3]) ).
cnf(eq_8,negated_conjecture,
f(x0,neg(x0)) != f(x1,neg(x1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_4,eq_3]),eq_3]) ).
cnf(eq_9,plain,
and(B,B) = or(B,B),
inference(cp,[status(thm)],[eq_2,eq_1]) ).
cnf(eq_10,plain,
f(f(or(B,B),x103),f(B,f(f(B,f(f(B,B),B)),B))) = B,
inference(cp,[status(thm)],[eq_1,eq_0]) ).
cnf(eq_11,plain,
f(A,f(f(A,C),f(f(f(A,C),f(neg(f(B,A)),f(B,A))),x102))) = f(A,C),
inference(cp,[status(thm)],[eq_5,eq_5]) ).
cnf(eq_12,plain,
f(f(neg(f(x100,x100)),x103),f(x100,f(f(x100,f(neg(x100),x100)),x100))) = x100,
inference(cp,[status(thm)],[eq_3,eq_5]) ).
cnf(eq_13,plain,
f(f(f(f(x100,A),neg(A)),x103),f(A,f(f(A,f(neg(x100),x100)),A))) = A,
inference(cp,[status(thm)],[eq_3,eq_5]) ).
cnf(eq_14,plain,
neg(neg(x100)) = or(x100,x100),
inference(cp,[status(thm)],[eq_3,eq_7]) ).
cnf(eq_15,plain,
neg(or(A,B)) = and(neg(A),neg(B)),
inference(cp,[status(thm)],[eq_7,eq_6]) ).
cnf(eq_16,plain,
neg(neg(A)) = and(A,A),
inference(cp,[status(thm)],[eq_3,eq_6]) ).
cnf(eq_17,plain,
f(A,B) = f(A,f(f(A,B),f(f(f(A,B),f(neg(f(C,A)),f(C,A))),D))),
eq_11 ).
cnf(eq_18,plain,
or(A,A) = and(A,A),
eq_9 ).
cnf(eq_19,plain,
or(A,A) = neg(neg(A)),
eq_14 ).
cnf(eq_20,plain,
A = f(f(f(f(B,A),neg(A)),C),f(A,f(f(A,f(neg(B),B)),A))),
eq_13 ).
cnf(eq_21,plain,
and(A,A) = neg(neg(A)),
eq_16 ).
cnf(eq_22,plain,
A = f(f(neg(neg(A)),B),f(A,f(f(A,f(neg(A),A)),A))),
inference(rw,[status(thm)],[eq_12,eq_3]) ).
cnf(eq_23,plain,
f(f(B,A),f(f(f(B,A),f(A,C)),A)) = f(f(B,A),f(A,C)),
inference(cp,[status(thm)],[eq_5,eq_17]) ).
cnf(eq_24,plain,
f(f(A,B),f(B,C)) = f(f(A,B),f(f(f(A,B),f(B,C)),B)),
eq_23 ).
cnf(eq_25,plain,
f(f(neg(neg(A)),A),f(A,A)) = f(f(neg(neg(A)),A),f(A,f(f(A,f(neg(A),A)),A))),
inference(cp,[status(thm)],[eq_22,eq_24]) ).
cnf(eq_26,plain,
f(f(f(f(B,A),neg(A)),A),f(A,A)) = f(f(f(f(B,A),neg(A)),A),f(A,f(f(A,f(neg(B),B)),A))),
inference(cp,[status(thm)],[eq_20,eq_24]) ).
cnf(eq_27,plain,
A = f(f(f(f(B,A),neg(A)),A),neg(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_26,eq_3]),eq_20]) ).
cnf(eq_28,plain,
A = f(f(neg(neg(A)),A),neg(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_25,eq_3]),eq_22]) ).
cnf(eq_29,plain,
f(f(A,A),neg(A)) = A,
inference(cp,[status(thm)],[eq_28,eq_27]) ).
cnf(eq_30,plain,
f(or(neg(neg(B)),B),neg(neg(B))) = neg(B),
inference(cp,[status(thm)],[eq_7,eq_28]) ).
cnf(eq_31,plain,
f(or(neg(neg(A)),A),neg(neg(A))) = neg(A),
eq_30 ).
cnf(eq_32,plain,
A = neg(neg(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_29,eq_3]),eq_7]),eq_19]) ).
cnf(eq_33,plain,
f(A,neg(x101)) = or(neg(A),x101),
inference(cp,[status(thm)],[eq_32,eq_7]) ).
cnf(eq_34,plain,
f(neg(x100),A) = or(x100,neg(A)),
inference(cp,[status(thm)],[eq_32,eq_7]) ).
cnf(eq_35,plain,
f(neg(A),B) = or(A,neg(B)),
eq_34 ).
cnf(eq_36,plain,
f(A,neg(B)) = or(neg(A),B),
eq_33 ).
cnf(eq_37,plain,
f(or(A,A),A) = neg(A),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_31,eq_32]),eq_32]) ).
cnf(eq_38,plain,
A = or(A,A),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_21,eq_18]),eq_32]) ).
cnf(eq_39,plain,
f(x100,A) = or(neg(x100),neg(A)),
inference(cp,[status(thm)],[eq_32,eq_36]) ).
cnf(eq_40,plain,
neg(and(A,B)) = f(A,B),
inference(cp,[status(thm)],[eq_6,eq_32]) ).
cnf(eq_41,plain,
f(A,B) = or(neg(A),neg(B)),
eq_39 ).
cnf(eq_42,plain,
f(A,B) = neg(and(A,B)),
eq_40 ).
cnf(eq_43,plain,
neg(f(or(A,A),A)) = A,
inference(cp,[status(thm)],[eq_37,eq_32]) ).
cnf(eq_44,plain,
A = and(or(A,A),A),
inference(rw,[status(thm)],[eq_43,eq_6]) ).
cnf(eq_45,plain,
or(neg(A),neg(B)) = neg(and(A,B)),
inference(rw,[status(thm)],[eq_42,eq_41]) ).
cnf(eq_46,plain,
A = and(A,A),
inference(rw,[status(thm)],[eq_44,eq_38]) ).
cnf(eq_47,plain,
or(A,neg(B)) = neg(and(neg(A),B)),
inference(rw,[status(thm)],[eq_35,eq_42]) ).
cnf(eq_48,negated_conjecture,
neg(and(x0,neg(x0))) != neg(and(x1,neg(x1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_8,eq_42]),eq_42]) ).
cnf(eq_49,plain,
A = f(f(A,B),f(A,f(f(A,f(f(A,A),A)),A))),
inference(rw,[status(thm)],[eq_10,eq_38]) ).
cnf(eq_50,plain,
f(f(x100,x101),f(x101,f(f(x101,f(f(x100,x100),x100)),x102))) = x101,
inference(cp,[status(thm)],[eq_49,eq_0]) ).
cnf(eq_51,plain,
A = f(f(B,A),f(A,f(f(A,f(f(B,B),B)),C))),
eq_50 ).
cnf(eq_52,plain,
A = and(A,f(f(A,f(f(A,A),A)),A)),
inference(cp,[status(thm)],[eq_49,eq_2]) ).
cnf(eq_53,plain,
f(f(x100,A),f(A,A)) = A,
inference(cp,[status(thm)],[eq_49,eq_51]) ).
cnf(eq_54,plain,
A = f(f(B,A),f(A,A)),
eq_53 ).
cnf(eq_55,plain,
A = and(A,or(and(A,or(A,neg(A))),neg(A))),
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_52,eq_42]),eq_46]),eq_42]),eq_47]),eq_42]),eq_42]),eq_47]) ).
cnf(eq_56,plain,
A = or(and(B,A),A),
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_54,eq_42]),eq_42]),eq_46]),eq_42]),eq_47]),eq_32]) ).
cnf(eq_57,plain,
f(f(x100,f(A,A)),A) = f(A,A),
inference(cp,[status(thm)],[eq_54,eq_54]) ).
cnf(eq_58,plain,
f(A,A) = f(f(B,f(A,A)),A),
eq_57 ).
cnf(eq_59,plain,
f(or(neg(A),B),B) = neg(B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_58,eq_3]),eq_3]),eq_36]) ).
cnf(eq_60,plain,
f(or(A,x101),x101) = neg(x101),
inference(cp,[status(thm)],[eq_32,eq_59]) ).
cnf(eq_61,plain,
f(or(A,B),B) = neg(B),
eq_60 ).
cnf(eq_62,plain,
A = or(and(A,B),A),
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)],[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)],[inference(rw,[status(thm)],[eq_49,eq_41]),eq_41]),eq_38]),eq_41]),eq_32]),eq_41]),eq_15]),eq_32]),eq_41]),eq_15]),eq_32]),eq_45]),eq_32]),eq_41]),eq_15]),eq_45]),eq_32]),eq_15]),eq_32]),eq_41]),eq_15]),eq_15]),eq_32]),eq_32]),eq_32]),eq_45]),eq_15]),eq_32]),eq_45]),eq_32]),eq_55]) ).
cnf(eq_63,plain,
or(neg(f(A,B)),B) = B,
inference(cp,[status(thm)],[eq_6,eq_56]) ).
cnf(eq_64,plain,
A = or(neg(f(B,A)),A),
eq_63 ).
cnf(eq_65,plain,
A = f(f(B,A),neg(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_64,eq_6]),eq_7]),eq_40]) ).
cnf(eq_66,plain,
A = f(f(A,B),neg(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_62,eq_7]),eq_40]) ).
cnf(eq_67,plain,
f(f(neg(A),neg(B)),B) = neg(B),
inference(rw,[status(thm)],[eq_61,eq_7]) ).
cnf(eq_68,plain,
f(A,neg(f(B,A))) = f(B,A),
inference(cp,[status(thm)],[eq_65,eq_66]) ).
cnf(eq_69,plain,
f(A,neg(f(A,B))) = f(A,B),
inference(cp,[status(thm)],[eq_66,eq_66]) ).
cnf(eq_70,plain,
f(f(A,neg(x101)),x101) = neg(x101),
inference(cp,[status(thm)],[eq_32,eq_67]) ).
cnf(eq_71,plain,
f(A,B) = f(B,and(A,B)),
inference(rw,[status(thm)],[eq_68,eq_6]) ).
cnf(eq_72,plain,
f(f(A,neg(B)),B) = neg(B),
eq_70 ).
cnf(eq_73,plain,
f(A,B) = f(B,neg(f(A,B))),
inference(rw,[status(thm)],[eq_71,eq_6]) ).
cnf(eq_74,plain,
A = neg(f(A,f(f(A,f(neg(B),B)),C))),
inference(cp,[status(thm)],[eq_5,eq_72]) ).
cnf(eq_75,plain,
neg(f(x100,neg(f(x100,f(neg(x101),x101))))) = x100,
inference(cp,[status(thm)],[eq_3,eq_74]) ).
cnf(eq_76,plain,
A = neg(f(A,f(neg(B),B))),
inference(rw,[status(thm)],[eq_75,eq_69]) ).
cnf(eq_77,plain,
neg(A) = f(A,f(neg(B),B)),
inference(cp,[status(thm)],[eq_76,eq_32]) ).
cnf(eq_78,plain,
f(A,f(neg(B),B)) = neg(A),
eq_77 ).
cnf(eq_79,plain,
f(x100,f(A,neg(A))) = neg(x100),
inference(cp,[status(thm)],[eq_32,eq_78]) ).
cnf(eq_80,plain,
f(f(neg(B),B),neg(neg(A))) = f(A,f(neg(B),B)),
inference(cp,[status(thm)],[eq_78,eq_73]) ).
cnf(eq_81,plain,
f(A,f(B,neg(B))) = neg(A),
eq_79 ).
cnf(eq_82,plain,
f(f(neg(A),A),B) = neg(B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_80,eq_32]),eq_78]) ).
cnf(eq_83,plain,
f(A,or(neg(B),B)) = neg(A),
inference(rw,[status(thm)],[eq_81,eq_36]) ).
cnf(eq_84,plain,
f(or(A,neg(A)),B) = neg(B),
inference(rw,[status(thm)],[eq_82,eq_35]) ).
cnf(eq_85,plain,
neg(or(x100,neg(x100))) = neg(or(neg(B),B)),
inference(cp,[status(thm)],[eq_83,eq_84]) ).
cnf(eq_86,plain,
neg(or(A,neg(A))) = neg(or(neg(B),B)),
eq_85 ).
cnf(eq_87,plain,
and(A,neg(A)) = and(neg(B),B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_86,eq_15]),eq_32]),eq_15]),eq_32]) ).
cnf(eq_88,negated_conjecture,
neg(and(neg(B),B)) != neg(and(x1,neg(x1))),
inference(cp,[status(thm)],[eq_87,eq_48]) ).
cnf(eq_89,negated_conjecture,
neg(and(neg(A),A)) != neg(and(x1,neg(x1))),
eq_88 ).
cnf(eq_90,negated_conjecture,
neg(and(A,neg(A))) != neg(and(x1,neg(x1))),
inference(cp,[status(thm)],[eq_87,eq_89]) ).
cnf(eq_91,negated_conjecture,
neg(and(A,neg(A))) != neg(and(A,neg(A))),
eq_90 ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% 0.03/0.13 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n011.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 04:56:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.77/3.96 % SZS status Unsatisfiable
% 3.77/3.96 % SZS output start CNFRefutation for /tmp/MaedMax_12560
% See solution above
% 3.77/3.97
%------------------------------------------------------------------------------