%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN707-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 03:25:56 PM UTC 2026
% Result : Unsatisfiable 6.59s 1.60s
% Output : CNFRefutation 6.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 57 ( 19 unt; 0 nHn; 53 RR)
% Number of literals : 128 ( 0 equ; 75 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p10_37,negated_conjecture,
( ~ p10(X3,X2)
| ~ p10(X3,X1)
| p10(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_37) ).
cnf(p16_42,negated_conjecture,
( ~ p16(X3,X2)
| ~ p16(X3,X1)
| p16(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_42) ).
cnf(p39_52,negated_conjecture,
( ~ p16(X4,X1)
| ~ p39(X4,X3)
| ~ p16(X3,X2)
| p39(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p39_52) ).
cnf(p16_36,negated_conjecture,
( ~ p38(X1)
| p16(f19(f15(X1)),f28(f19(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_36) ).
cnf(p10_3,negated_conjecture,
p10(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_3) ).
cnf(p16_8,negated_conjecture,
p16(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_8) ).
cnf(p39_54,negated_conjecture,
( ~ p37(X1,X2)
| ~ p38(X1)
| ~ p38(X2)
| p39(f19(X1),f19(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p39_54) ).
cnf(p38_15,negated_conjecture,
( ~ p38(X1)
| p38(f15(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p38_15) ).
cnf(p38_19,negated_conjecture,
( ~ p10(X2,X1)
| ~ p38(X2)
| p38(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p38_19) ).
cnf(p10_66,negated_conjecture,
p10(c48,f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_66) ).
cnf(f11_is_p38_64,negated_conjecture,
p38(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11_is_p38_64) ).
cnf(p37_13,negated_conjecture,
p37(f15(c56),c48),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p37_13) ).
cnf(c56_is_p38_1,negated_conjecture,
p38(c56),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c56_is_p38_1) ).
cnf(p16_32,negated_conjecture,
( ~ p10(X1,X2)
| p16(f19(X1),f19(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p16_32) ).
cnf(not_p39_69,negated_conjecture,
~ p39(f28(f19(c56)),f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p39_69) ).
cnf(c_0_15,negated_conjecture,
( ~ p10(X3,X2)
| ~ p10(X3,X1)
| p10(X1,X2) ),
inference(fof_simplification,[status(thm)],[p10_37]) ).
cnf(c_0_16,negated_conjecture,
( ~ p16(X3,X2)
| ~ p16(X3,X1)
| p16(X1,X2) ),
inference(fof_simplification,[status(thm)],[p16_42]) ).
cnf(c_0_17,negated_conjecture,
( ~ p16(X4,X1)
| ~ p39(X4,X3)
| ~ p16(X3,X2)
| p39(X1,X2) ),
inference(fof_simplification,[status(thm)],[p39_52]) ).
cnf(c_0_18,negated_conjecture,
( ~ p38(X1)
| p16(f19(f15(X1)),f28(f19(X1))) ),
inference(fof_simplification,[status(thm)],[p16_36]) ).
cnf(c_0_19,negated_conjecture,
( ~ p10(X3,X2)
| ~ p10(X3,X1)
| p10(X1,X2) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
p10(X1,X1),
p10_3 ).
cnf(c_0_21,negated_conjecture,
( ~ p16(X3,X2)
| ~ p16(X3,X1)
| p16(X1,X2) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
p16(X1,X1),
p16_8 ).
cnf(c_0_23,negated_conjecture,
( ~ p16(X4,X1)
| ~ p39(X4,X3)
| ~ p16(X3,X2)
| p39(X1,X2) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
( ~ p38(X1)
| p16(f19(f15(X1)),f28(f19(X1))) ),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
( ~ p37(X1,X2)
| ~ p38(X1)
| ~ p38(X2)
| p39(f19(X1),f19(X2)) ),
inference(fof_simplification,[status(thm)],[p39_54]) ).
cnf(c_0_26,negated_conjecture,
( ~ p38(X1)
| p38(f15(X1)) ),
inference(fof_simplification,[status(thm)],[p38_15]) ).
cnf(c_0_27,negated_conjecture,
( ~ p10(X2,X1)
| ~ p38(X2)
| p38(X1) ),
inference(fof_simplification,[status(thm)],[p38_19]) ).
cnf(c_0_28,negated_conjecture,
( ~ p10(X2,X1)
| p10(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
p10(c48,f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
p10_66 ).
cnf(c_0_30,negated_conjecture,
( ~ p16(X2,X1)
| p16(X1,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( ~ p38(X1)
| ~ p16(X3,X2)
| ~ p39(f19(f15(X1)),X3)
| p39(f28(f19(X1)),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( ~ p37(X1,X2)
| ~ p38(X1)
| ~ p38(X2)
| p39(f19(X1),f19(X2)) ),
c_0_25 ).
cnf(c_0_33,negated_conjecture,
( ~ p38(X1)
| p38(f15(X1)) ),
c_0_26 ).
cnf(c_0_34,negated_conjecture,
( ~ p10(X2,X1)
| ~ p38(X2)
| p38(X1) ),
c_0_27 ).
cnf(c_0_35,negated_conjecture,
p10(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))),c48),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
p38(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44))))),
f11_is_p38_64 ).
cnf(c_0_37,negated_conjecture,
( ~ p38(X1)
| p16(f28(f19(X1)),f19(f15(X1))) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_38,negated_conjecture,
( ~ p38(X3)
| ~ p38(X1)
| ~ p16(f19(X3),X2)
| ~ p37(f15(X1),X3)
| p39(f28(f19(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
p37(f15(c56),c48),
p37_13 ).
cnf(c_0_40,negated_conjecture,
p38(c56),
c56_is_p38_1 ).
cnf(c_0_41,negated_conjecture,
p38(c48),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
( ~ p38(X1)
| ~ p16(X3,X2)
| ~ p39(f28(f19(X1)),X3)
| p39(f19(f15(X1)),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( ~ p16(f19(c48),X1)
| p39(f28(f19(c56)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
( ~ p10(X1,X2)
| p16(f19(X1),f19(X2)) ),
inference(fof_simplification,[status(thm)],[p16_32]) ).
cnf(c_0_45,negated_conjecture,
( ~ p16(X2,X1)
| ~ p16(f19(c48),X2)
| p39(f19(f15(c56)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_40])]) ).
cnf(c_0_46,negated_conjecture,
( ~ p10(X1,X2)
| p16(f19(X1),f19(X2)) ),
c_0_44 ).
cnf(c_0_47,negated_conjecture,
( ~ p10(c48,X2)
| ~ p16(f19(X2),X1)
| p39(f19(f15(c56)),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( ~ p10(X3,X2)
| ~ p16(f19(X3),X1)
| p16(X1,f19(X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ p10(c48,X1)
| p39(f19(f15(c56)),f19(X1)) ),
inference(spm,[status(thm)],[c_0_47,c_0_22]) ).
cnf(c_0_50,negated_conjecture,
( ~ p10(X3,X1)
| ~ p10(X3,X2)
| p16(f19(X1),f19(X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
~ p39(f28(f19(c56)),f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))),
inference(fof_simplification,[status(thm)],[not_p39_69]) ).
cnf(c_0_52,negated_conjecture,
( ~ p10(c48,X2)
| ~ p16(f19(X2),X1)
| p39(f28(f19(c56)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_49]),c_0_40])]) ).
cnf(c_0_53,negated_conjecture,
( ~ p10(c48,X1)
| p16(f19(X1),f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))) ),
inference(spm,[status(thm)],[c_0_50,c_0_29]) ).
cnf(c_0_54,negated_conjecture,
~ p39(f28(f19(c56)),f19(f11(f13(f5(c44),f14(f5(f6(f7(f7(f6(f6(f7(f7(c44)))))))),f5(c44)))))),
c_0_51 ).
cnf(c_0_55,negated_conjecture,
~ p10(c48,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_29,c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.23 % Problem : SYN707-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.25 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.73 % Computer : n006.cluster.edu
% 0.11/0.73 % Model : x86_64 x86_64
% 0.11/0.73 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.73 % Memory : 8046.5625MB
% 0.11/0.73 % OS : Linux 6.8.0-71-generic
% 0.11/0.73 % CPULimit : 300
% 0.11/0.73 % WCLimit : 300
% 0.11/0.73 % DateTime : Mon Sep 21 11:12:44 UTC 2026
% 0.11/0.73 % CPUTime :
% 0.11/0.73 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.77 Running first-order theorem proving
% 0.11/0.77 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
% 6.59/1.60 % Version: 3.5.1
% 6.59/1.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.59/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.59/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.59/1.60 % Starting new_bool_3 with 300s (1) cores
% 6.59/1.60 % Starting new_bool_1 with 300s (1) cores
% 6.59/1.60 % Starting sh5l with 300s (1) cores
% 6.59/1.60 % new_bool_3 with pid 2713707 completed with status 0
% 6.59/1.60 % Result found by new_bool_3
% 6.59/1.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.59/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.59/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.59/1.60 % Starting new_bool_3 with 300s (1) cores
% 6.59/1.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 6.59/1.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.59/1.60 % Search class: FHUNM-FFMM21-DFFFFFNN
% 6.59/1.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.59/1.60 % Starting SubtermCWHack with 31s (1) cores
% 6.59/1.60 % SubtermCWHack with pid 2713714 completed with status 0
% 6.59/1.60 % Result found by SubtermCWHack
% 6.59/1.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 6.59/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.59/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 6.59/1.60 % Starting new_bool_3 with 300s (1) cores
% 6.59/1.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 6.59/1.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.59/1.60 % Search class: FHUNM-FFMM21-DFFFFFNN
% 6.59/1.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.59/1.60 % Starting SubtermCWHack with 31s (1) cores
% 6.59/1.60 % Preprocessing time : 0.002 s
% 6.59/1.60
% 6.59/1.60 % Proof found!
% 6.59/1.60 % SZS status Unsatisfiable
% 6.59/1.60 % SZS output start CNFRefutation
% See solution above
% 6.59/1.60 % Parsed axioms : 83
% 6.59/1.60 % Removed by relevancy pruning/SinE : 0
% 6.59/1.60 % Initial clauses : 83
% 6.59/1.60 % Removed in clause preprocessing : 0
% 6.59/1.60 % Initial clauses in saturation : 83
% 6.59/1.60 % Processed clauses : 9281
% 6.59/1.60 % ...of these trivial : 0
% 6.59/1.60 % ...subsumed : 5826
% 6.59/1.60 % ...remaining for further processing : 3455
% 6.59/1.60 % Other redundant clauses eliminated : 0
% 6.59/1.60 % Clauses deleted for lack of memory : 0
% 6.59/1.60 % Backward-subsumed : 112
% 6.59/1.60 % Backward-rewritten : 0
% 6.59/1.60 % Generated clauses : 84233
% 6.59/1.60 % ...of the previous two non-redundant : 83808
% 6.59/1.60 % ...aggressively subsumed : 0
% 6.59/1.60 % Contextual simplify-reflections : 1
% 6.59/1.60 % Paramodulations : 84232
% 6.59/1.60 % Factorizations : 0
% 6.59/1.60 % NegExts : 0
% 6.59/1.60 % Equation resolutions : 0
% 6.59/1.60 % Disequality decompositions : 0
% 6.59/1.60 % Total rewrite steps : 705
% 6.59/1.60 % ...of those cached : 623
% 6.59/1.60 % Propositional unsat checks : 0
% 6.59/1.60 % Propositional check models : 0
% 6.59/1.60 % Propositional check unsatisfiable : 0
% 6.59/1.60 % Propositional clauses : 0
% 6.59/1.60 % Propositional clauses after purity: 0
% 6.59/1.60 % Propositional unsat core size : 0
% 6.59/1.60 % Propositional preprocessing time : 0.000
% 6.59/1.60 % Propositional encoding time : 0.000
% 6.59/1.60 % Propositional solver time : 0.000
% 6.59/1.60 % Success case prop preproc time : 0.000
% 6.59/1.60 % Success case prop encoding time : 0.000
% 6.59/1.60 % Success case prop solver time : 0.000
% 6.59/1.60 % Current number of processed clauses : 3342
% 6.59/1.60 % Positive orientable unit clauses : 60
% 6.59/1.60 % Positive unorientable unit clauses: 0
% 6.59/1.60 % Negative unit clauses : 6
% 6.59/1.60 % Non-unit-clauses : 3276
% 6.59/1.60 % Current number of unprocessed clauses: 74610
% 6.59/1.60 % ...number of literals in the above : 239463
% 6.59/1.60 % Current number of archived formulas : 0
% 6.59/1.60 % Current number of archived clauses : 113
% 6.59/1.60 % Clause-clause subsumption calls (NU) : 1821085
% 6.59/1.60 % Rec. Clause-clause subsumption calls : 1401252
% 6.59/1.60 % Non-unit clause-clause subsumptions : 5829
% 6.59/1.60 % Unit Clause-clause subsumption calls : 2161
% 6.59/1.60 % Rewrite failures with RHS unbound : 0
% 6.59/1.60 % BW rewrite match attempts : 285
% 6.59/1.60 % BW rewrite match successes : 0
% 6.59/1.60 % Condensation attempts : 0
% 6.59/1.60 % Condensation successes : 0
% 6.59/1.60 % Termbank termtop insertions : 1926007
% 6.59/1.60 % Search garbage collected termcells : 171
% 6.59/1.60
% 6.59/1.60 % -------------------------------------------------
% 6.59/1.60 % User time : 0.750 s
% 6.59/1.60 % System time : 0.041 s
% 6.59/1.60 % Total time : 0.791 s
% 6.59/1.60 % Maximum resident set size: 3760 pages
% 6.59/1.60
% 6.59/1.60 % -------------------------------------------------
% 6.59/1.60 % User time : 0.755 s
% 6.59/1.60 % System time : 0.044 s
% 6.59/1.60 % Total time : 0.799 s
% 6.59/1.60 % Maximum resident set size: 4864 pages
% 6.59/1.60 % E exiting
%------------------------------------------------------------------------------