%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG246-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 11:55:44 AM UTC 2026
% Result : Unsatisfiable 191.69s 37.83s
% Output : CNFRefutation 191.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 14
% Syntax : Number of clauses : 119 ( 119 unt; 0 nHn; 10 RR)
% Number of literals : 119 ( 118 equ; 4 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 : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 197 ( 38 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c04,axiom,
tptp0(tptp1(X1,X2),X3) = tptp0(X1,tptp0(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c01,axiom,
tptp1(X1,X2) = tptp1(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c09,axiom,
tptp0(tptp1(X1,X2),tptp3) = v(tptp0(X1,tptp3),tptp0(X2,tptp3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c05,axiom,
tptp0(tptp3,X1) = tptp5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c02,axiom,
tptp1(tptp5,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c11,axiom,
n(X1) = m(tptp2(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c11) ).
cnf(c10,axiom,
m(X1) = tptp0(X1,tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
cnf(c03,axiom,
tptp1(X1,tptp0(X1,X2)) = tptp1(X2,tptp0(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c07,axiom,
tptp4(X1,X2) = tptp1(X1,tptp0(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c08,axiom,
v(X1,X2) = tptp4(tptp0(tptp0(X1,X2),X2),tptp0(tptp0(X2,X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c13,axiom,
n(tptp0(X1,X2)) = n(tptp0(tptp2(X2),tptp2(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c13) ).
cnf(c12,axiom,
tptp2(tptp2(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c12) ).
cnf(c06,axiom,
tptp0(tptp0(tptp0(X1,X2),X3),tptp0(tptp0(tptp0(X2,X1),X3),X3)) = tptp5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(goals,negated_conjecture,
v(tptp1(n(a),n(tptp0(a,b))),n(b)) != n(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_14,axiom,
tptp0(tptp1(X1,X2),X3) = tptp0(X1,tptp0(X2,X3)),
c04 ).
cnf(c_0_15,axiom,
tptp1(X1,X2) = tptp1(X2,X1),
c01 ).
cnf(c_0_16,axiom,
tptp0(tptp1(X1,X2),tptp3) = v(tptp0(X1,tptp3),tptp0(X2,tptp3)),
c09 ).
cnf(c_0_17,axiom,
tptp0(tptp3,X1) = tptp5,
c05 ).
cnf(c_0_18,plain,
tptp0(X1,tptp0(X2,X3)) = tptp0(X2,tptp0(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
cnf(c_0_19,axiom,
tptp1(tptp5,X1) = X1,
c02 ).
cnf(c_0_20,plain,
v(tptp0(X1,tptp3),tptp0(X2,tptp3)) = tptp0(X1,tptp0(X2,tptp3)),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,axiom,
n(X1) = m(tptp2(X1)),
c11 ).
cnf(c_0_22,axiom,
m(X1) = tptp0(X1,tptp3),
c10 ).
cnf(c_0_23,axiom,
tptp1(X1,tptp0(X1,X2)) = tptp1(X2,tptp0(X2,X1)),
c03 ).
cnf(c_0_24,plain,
tptp0(X1,tptp5) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_25,plain,
tptp1(X1,tptp5) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_26,axiom,
tptp4(X1,X2) = tptp1(X1,tptp0(X1,X2)),
c07 ).
cnf(c_0_27,plain,
v(tptp5,tptp0(X1,tptp3)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_17]) ).
cnf(c_0_28,plain,
tptp0(tptp2(X1),tptp3) = n(X1),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,axiom,
v(X1,X2) = tptp4(tptp0(tptp0(X1,X2),X2),tptp0(tptp0(X2,X1),X1)),
c08 ).
cnf(c_0_30,plain,
tptp0(tptp5,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_19]) ).
cnf(c_0_31,plain,
tptp4(X1,tptp5) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_25]) ).
cnf(c_0_32,plain,
v(tptp5,n(X1)) = tptp5,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
tptp0(X1,X1) = v(tptp5,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24]),c_0_24]),c_0_31]) ).
cnf(c_0_34,plain,
tptp0(n(X1),n(X1)) = tptp5,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,axiom,
n(tptp0(X1,X2)) = n(tptp0(tptp2(X2),tptp2(X1))),
c13 ).
cnf(c_0_36,axiom,
tptp2(tptp2(X1)) = X1,
c12 ).
cnf(c_0_37,plain,
tptp4(n(X1),n(X1)) = n(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_34]),c_0_25]) ).
cnf(c_0_38,axiom,
tptp0(tptp0(tptp0(X1,X2),X3),tptp0(tptp0(tptp0(X2,X1),X3),X3)) = tptp5,
c06 ).
cnf(c_0_39,plain,
n(tptp0(tptp2(X1),X2)) = n(tptp0(tptp2(X2),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
v(n(X1),n(X1)) = n(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_30]),c_0_34]),c_0_30]),c_0_37]) ).
cnf(c_0_41,plain,
n(tptp2(X1)) = tptp0(X1,tptp3),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_42,plain,
tptp0(X1,tptp0(tptp0(X2,X1),X1)) = tptp5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_30]),c_0_24]),c_0_30]),c_0_18]) ).
cnf(c_0_43,plain,
n(tptp0(tptp2(tptp5),X1)) = n(tptp5),
inference(spm,[status(thm)],[c_0_39,c_0_24]) ).
cnf(c_0_44,plain,
tptp0(X1,tptp0(X1,tptp3)) = tptp0(X1,tptp3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_20]) ).
cnf(c_0_45,plain,
n(tptp0(X1,tptp2(X2))) = n(tptp0(X2,tptp2(X1))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_46,plain,
tptp0(X1,X1) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_17]),c_0_30]) ).
cnf(c_0_47,plain,
tptp1(n(X1),tptp2(X1)) = tptp3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_17]),c_0_25]),c_0_15]) ).
cnf(c_0_48,plain,
n(n(tptp5)) = n(tptp5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_28]) ).
cnf(c_0_49,plain,
n(tptp0(X1,tptp2(tptp3))) = n(tptp5),
inference(spm,[status(thm)],[c_0_45,c_0_17]) ).
cnf(c_0_50,plain,
tptp0(tptp4(X1,X2),X3) = tptp0(X1,tptp0(tptp0(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_51,plain,
tptp0(X1,tptp0(X2,X1)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_46]),c_0_24]) ).
cnf(c_0_52,plain,
tptp1(n(tptp5),tptp2(n(tptp5))) = tptp3,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
n(tptp5) = tptp5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_30]),c_0_41]),c_0_17]) ).
cnf(c_0_54,plain,
tptp0(tptp4(X1,X2),X1) = tptp5,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
tptp4(tptp1(X1,X2),X3) = tptp1(tptp1(X1,X2),tptp0(X1,tptp0(X2,X3))),
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_56,plain,
tptp4(X1,X2) = tptp1(X2,tptp0(X2,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_57,plain,
tptp1(n(tptp0(X1,X2)),tptp2(tptp0(tptp2(X2),tptp2(X1)))) = tptp3,
inference(spm,[status(thm)],[c_0_47,c_0_35]) ).
cnf(c_0_58,plain,
tptp2(tptp5) = tptp3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_53]),c_0_19]) ).
cnf(c_0_59,plain,
tptp0(X1,tptp0(tptp0(X1,X2),X2)) = tptp5,
inference(spm,[status(thm)],[c_0_18,c_0_46]) ).
cnf(c_0_60,plain,
tptp1(X1,tptp0(X1,tptp3)) = tptp3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_17]),c_0_25]) ).
cnf(c_0_61,plain,
tptp0(tptp4(X1,X2),tptp0(X3,X1)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_54]),c_0_24]) ).
cnf(c_0_62,plain,
tptp4(tptp1(X1,X2),X1) = tptp1(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_25]) ).
cnf(c_0_63,plain,
tptp4(X1,X2) = tptp4(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_56]) ).
cnf(c_0_64,plain,
tptp2(tptp0(tptp2(X1),tptp2(tptp4(X1,X2)))) = tptp3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_54]),c_0_53]),c_0_19]) ).
cnf(c_0_65,plain,
tptp2(tptp3) = tptp5,
inference(spm,[status(thm)],[c_0_36,c_0_58]) ).
cnf(c_0_66,plain,
tptp0(tptp4(X1,X2),X2) = tptp5,
inference(spm,[status(thm)],[c_0_50,c_0_59]) ).
cnf(c_0_67,plain,
tptp0(X1,tptp0(tptp0(X1,tptp3),X2)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_60]),c_0_17]) ).
cnf(c_0_68,plain,
n(tptp0(X1,tptp3)) = tptp0(X1,tptp3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_58]),c_0_30]),c_0_41]) ).
cnf(c_0_69,plain,
tptp0(tptp4(tptp4(X1,X2),X3),X1) = tptp5,
inference(spm,[status(thm)],[c_0_50,c_0_61]) ).
cnf(c_0_70,plain,
tptp4(X1,tptp1(X1,X2)) = tptp1(X1,X2),
inference(rw,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,plain,
tptp0(tptp2(X1),tptp2(tptp4(X1,X2))) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_64]),c_0_65]) ).
cnf(c_0_72,plain,
tptp4(X1,tptp4(X2,X1)) = tptp4(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_66]),c_0_25]) ).
cnf(c_0_73,plain,
tptp4(X1,tptp0(tptp0(X1,tptp3),X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_67]),c_0_25]) ).
cnf(c_0_74,plain,
n(tptp0(X1,tptp0(X2,tptp3))) = tptp0(X1,tptp0(X2,tptp3)),
inference(spm,[status(thm)],[c_0_68,c_0_14]) ).
cnf(c_0_75,plain,
tptp0(tptp4(tptp1(X1,X2),X3),X1) = tptp5,
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,plain,
tptp0(tptp2(X1),tptp2(tptp4(X2,X1))) = tptp5,
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,plain,
tptp4(tptp2(X1),tptp0(n(X1),X2)) = tptp2(X1),
inference(spm,[status(thm)],[c_0_73,c_0_28]) ).
cnf(c_0_78,plain,
tptp0(tptp2(X1),tptp0(X2,tptp3)) = tptp0(X2,n(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_79,plain,
n(tptp0(X1,n(X2))) = tptp0(X1,n(X2)),
inference(spm,[status(thm)],[c_0_74,c_0_28]) ).
cnf(c_0_80,plain,
tptp0(X1,tptp0(tptp0(X1,tptp1(X2,X3)),X2)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_56]),c_0_14]) ).
cnf(c_0_81,plain,
tptp0(tptp2(tptp0(n(X1),X2)),X1) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_36]) ).
cnf(c_0_82,plain,
tptp0(n(X1),tptp0(tptp2(X1),X2)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_47]),c_0_17]) ).
cnf(c_0_83,plain,
v(tptp0(X1,tptp3),n(X2)) = tptp0(X1,n(X2)),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_84,plain,
n(tptp0(tptp2(tptp0(X1,tptp3)),X2)) = tptp0(X1,n(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_78]),c_0_79]) ).
cnf(c_0_85,plain,
tptp0(tptp2(tptp0(n(tptp1(X1,X2)),X3)),X1) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_30]) ).
cnf(c_0_86,plain,
tptp4(n(X1),tptp0(tptp2(X1),X2)) = n(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_82]),c_0_25]) ).
cnf(c_0_87,plain,
v(n(X1),n(X2)) = tptp0(tptp2(X1),n(X2)),
inference(spm,[status(thm)],[c_0_83,c_0_28]) ).
cnf(c_0_88,plain,
n(n(X1)) = n(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_58]),c_0_28]),c_0_30]) ).
cnf(c_0_89,plain,
tptp0(n(tptp1(X1,X2)),n(X1)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_53]) ).
cnf(c_0_90,plain,
tptp1(X1,tptp0(X1,tptp4(X1,X2))) = tptp4(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_54]),c_0_25]) ).
cnf(c_0_91,plain,
tptp4(tptp0(X1,tptp3),tptp0(X1,X2)) = tptp0(X1,tptp3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_36]),c_0_41]),c_0_41]) ).
cnf(c_0_92,plain,
tptp0(tptp2(n(X1)),n(X2)) = tptp0(tptp2(X1),n(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_87]) ).
cnf(c_0_93,plain,
tptp0(X1,n(tptp0(tptp0(X1,tptp3),X2))) = tptp5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_67]),c_0_53]),c_0_28]),c_0_68]) ).
cnf(c_0_94,plain,
tptp0(n(tptp4(X1,X2)),n(X1)) = tptp5,
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,plain,
tptp4(tptp0(X1,X2),tptp0(X1,tptp3)) = tptp0(X1,tptp3),
inference(spm,[status(thm)],[c_0_63,c_0_91]) ).
cnf(c_0_96,plain,
tptp0(tptp2(X1),n(tptp0(n(X1),X2))) = tptp5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_28]),c_0_88]) ).
cnf(c_0_97,plain,
tptp0(tptp0(X1,tptp3),n(tptp0(X1,X2))) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_68]) ).
cnf(c_0_98,plain,
tptp4(X1,tptp0(tptp0(X1,X2),X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_59]),c_0_25]) ).
cnf(c_0_99,plain,
tptp0(tptp2(X1),n(tptp0(X2,tptp2(n(X1))))) = tptp5,
inference(spm,[status(thm)],[c_0_96,c_0_45]) ).
cnf(c_0_100,plain,
tptp0(X1,n(tptp0(X1,X2))) = n(tptp0(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_97]),c_0_30]),c_0_98]),c_0_83]) ).
cnf(c_0_101,plain,
n(tptp0(n(X1),X1)) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_35]) ).
cnf(c_0_102,plain,
tptp2(tptp0(n(X1),X1)) = tptp3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_101]),c_0_19]) ).
cnf(c_0_103,plain,
tptp0(n(X1),X1) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_102]),c_0_65]) ).
cnf(c_0_104,plain,
tptp1(X1,tptp0(X1,n(X1))) = n(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_103]),c_0_25]) ).
cnf(c_0_105,plain,
tptp1(X1,tptp0(X1,tptp4(X2,X1))) = tptp4(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_66]),c_0_25]) ).
cnf(c_0_106,plain,
tptp4(X1,tptp0(X2,X3)) = tptp1(X1,tptp0(X2,tptp0(X1,X3))),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_107,plain,
tptp2(n(X1)) = tptp0(n(X1),tptp3),
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(spm,[status(thm)],[c_0_104,c_0_92]),c_0_41]),c_0_18]),c_0_28]),c_0_46]),c_0_25]),c_0_41]) ).
cnf(c_0_108,negated_conjecture,
v(tptp1(n(a),n(tptp0(a,b))),n(b)) != n(b),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_109,plain,
tptp0(n(tptp4(X1,X2)),n(X2)) = tptp5,
inference(spm,[status(thm)],[c_0_89,c_0_105]) ).
cnf(c_0_110,plain,
tptp4(X1,tptp0(n(tptp0(X1,X2)),X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_103]),c_0_25]) ).
cnf(c_0_111,plain,
n(tptp0(n(X1),X2)) = tptp0(n(X1),n(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_107]),c_0_78]),c_0_79]) ).
cnf(c_0_112,negated_conjecture,
v(tptp1(n(a),n(tptp0(a,b))),n(b)) != n(b),
c_0_108 ).
cnf(c_0_113,plain,
v(X1,X2) = v(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_63]),c_0_29]) ).
cnf(c_0_114,plain,
tptp4(tptp0(tptp0(X1,tptp0(X2,X3)),X3),tptp0(tptp0(X3,tptp1(X1,X2)),tptp1(X1,X2))) = v(tptp1(X1,X2),X3),
inference(spm,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_115,plain,
tptp0(n(X1),tptp0(n(tptp0(X1,X2)),n(X2))) = tptp5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_116,negated_conjecture,
v(n(b),tptp1(n(a),n(tptp0(a,b)))) != n(b),
inference(rw,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_117,plain,
v(n(X1),tptp1(n(X2),n(tptp0(X2,X1)))) = n(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_30]),c_0_98]),c_0_113]) ).
cnf(c_0_118,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ALG246-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.31 % Computer : n012.cluster.edu
% 0.04/5.31 % Model : x86_64 x86_64
% 0.04/5.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.31 % Memory : 8046.5625MB
% 0.04/5.31 % OS : Linux 6.8.0-71-generic
% 0.04/5.31 % CPULimit : 300
% 0.04/5.31 % WCLimit : 300
% 0.04/5.31 % DateTime : Mon Sep 21 13:09:57 UTC 2026
% 0.04/5.31 % CPUTime :
% 0.04/5.31 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.33 Running first-order theorem proving
% 0.04/5.33 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 191.69/37.83 % Version: 3.5.1
% 191.69/37.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 191.69/37.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 191.69/37.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 191.69/37.83 % Starting new_bool_3 with 300s (1) cores
% 191.69/37.83 % Starting new_bool_1 with 300s (1) cores
% 191.69/37.83 % Starting sh5l with 300s (1) cores
% 191.69/37.83 % new_bool_3 with pid 2433106 completed with status 0
% 191.69/37.83 % Result found by new_bool_3
% 191.69/37.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 191.69/37.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 191.69/37.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 191.69/37.83 % Starting new_bool_3 with 300s (1) cores
% 191.69/37.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 191.69/37.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 191.69/37.83 % Search class: FUUPM-FFSF21-MFFFFFNN
% 191.69/37.83 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 191.69/37.83 % Starting SubtermCWHack with 28s (1) cores
% 191.69/37.83 % SubtermCWHack with pid 2433111 completed with status 8
% 191.69/37.83 % Starting new_bool_3 with 31s (1) cores
% 191.69/37.83 % new_bool_3 with pid 2433808 completed with status 0
% 191.69/37.83 % Result found by new_bool_3
% 191.69/37.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 191.69/37.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 191.69/37.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 191.69/37.83 % Starting new_bool_3 with 300s (1) cores
% 191.69/37.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 191.69/37.83 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 191.69/37.83 % Search class: FUUPM-FFSF21-MFFFFFNN
% 191.69/37.83 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 191.69/37.83 % Starting SubtermCWHack with 28s (1) cores
% 191.69/37.83 % SubtermCWHack with pid 2433111 completed with status 8
% 191.69/37.83 % Starting new_bool_3 with 31s (1) cores
% 191.69/37.83 % Preprocessing time : 0.001 s
% 191.69/37.83 % Presaturation interreduction done
% 191.69/37.83
% 191.69/37.83 % Proof found!
% 191.69/37.83 % SZS status Unsatisfiable
% 191.69/37.83 % SZS output start CNFRefutation
% See solution above
% 191.69/37.83 % Parsed axioms : 14
% 191.69/37.83 % Removed by relevancy pruning/SinE : 0
% 191.69/37.83 % Initial clauses : 14
% 191.69/37.83 % Removed in clause preprocessing : 0
% 191.69/37.83 % Initial clauses in saturation : 14
% 191.69/37.83 % Processed clauses : 5293
% 191.69/37.83 % ...of these trivial : 3950
% 191.69/37.83 % ...subsumed : 376
% 191.69/37.83 % ...remaining for further processing : 967
% 191.69/37.83 % Other redundant clauses eliminated : 0
% 191.69/37.83 % Clauses deleted for lack of memory : 0
% 191.69/37.83 % Backward-subsumed : 3
% 191.69/37.83 % Backward-rewritten : 136
% 191.69/37.83 % Generated clauses : 294927
% 191.69/37.83 % ...of the previous two non-redundant : 156981
% 191.69/37.83 % ...aggressively subsumed : 0
% 191.69/37.83 % Contextual simplify-reflections : 0
% 191.69/37.83 % Paramodulations : 294927
% 191.69/37.83 % Factorizations : 0
% 191.69/37.83 % NegExts : 0
% 191.69/37.83 % Equation resolutions : 0
% 191.69/37.83 % Disequality decompositions : 0
% 191.69/37.83 % Total rewrite steps : 563596
% 191.69/37.83 % ...of those cached : 497209
% 191.69/37.83 % Propositional unsat checks : 0
% 191.69/37.83 % Propositional check models : 0
% 191.69/37.83 % Propositional check unsatisfiable : 0
% 191.69/37.83 % Propositional clauses : 0
% 191.69/37.83 % Propositional clauses after purity: 0
% 191.69/37.83 % Propositional unsat core size : 0
% 191.69/37.83 % Propositional preprocessing time : 0.000
% 191.69/37.83 % Propositional encoding time : 0.000
% 191.69/37.83 % Propositional solver time : 0.000
% 191.69/37.83 % Success case prop preproc time : 0.000
% 191.69/37.83 % Success case prop encoding time : 0.000
% 191.69/37.83 % Success case prop solver time : 0.000
% 191.69/37.83 % Current number of processed clauses : 814
% 191.69/37.83 % Positive orientable unit clauses : 775
% 191.69/37.83 % Positive unorientable unit clauses: 39
% 191.69/37.83 % Negative unit clauses : 0
% 191.69/37.83 % Non-unit-clauses : 0
% 191.69/37.83 % Current number of unprocessed clauses: 151245
% 191.69/37.83 % ...number of literals in the above : 151245
% 191.69/37.83 % Current number of archived formulas : 0
% 191.69/37.83 % Current number of archived clauses : 153
% 191.69/37.83 % Clause-clause subsumption calls (NU) : 0
% 191.69/37.83 % Rec. Clause-clause subsumption calls : 0
% 191.69/37.83 % Non-unit clause-clause subsumptions : 0
% 191.69/37.83 % Unit Clause-clause subsumption calls : 410
% 191.69/37.83 % Rewrite failures with RHS unbound : 0
% 191.69/37.83 % BW rewrite match attempts : 5579
% 191.69/37.83 % BW rewrite match successes : 545
% 191.69/37.83 % Condensation attempts : 0
% 191.69/37.83 % Condensation successes : 0
% 191.69/37.83 % Termbank termtop insertions : 3682306
% 191.69/37.83 % Search garbage collected termcells : 2
% 191.69/37.83
% 191.69/37.83 % -------------------------------------------------
% 191.69/37.83 % User time : 30.564 s
% 191.69/37.83 % System time : 1.126 s
% 191.69/37.83 % Total time : 31.690 s
% 191.69/37.83 % Maximum resident set size: 3624 pages
% 191.69/37.83
% 191.69/37.83 % -------------------------------------------------
% 191.69/37.83 % User time : 30.564 s
% 191.69/37.83 % System time : 1.131 s
% 191.69/37.83 % Total time : 31.695 s
% 191.69/37.83 % Maximum resident set size: 4864 pages
% 191.69/37.83 % E exiting
%------------------------------------------------------------------------------