%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM765_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 01:50:35 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 89 ( 41 ~; 24 |; 3 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
frac: $tType ).
tff(decl_23,type,
x: frac ).
tff(decl_24,type,
y: frac ).
tff(decl_25,type,
z: frac ).
tff(decl_26,type,
u: frac ).
tff(decl_27,type,
moref: ( frac * frac ) > $o ).
tff(decl_28,type,
eq: ( frac * frac ) > $o ).
tff(decl_29,type,
pf: ( frac * frac ) > frac ).
tff(satz66,conjecture,
( ~ moref(pf(x,z),pf(y,u))
=> eq(pf(x,z),pf(y,u)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz66) ).
tff(satz65b,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( ( ~ moref(X4,X5)
=> eq(X4,X5) )
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65b) ).
tff(n,axiom,
( ~ moref(z,u)
=> eq(z,u) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
tff(m,axiom,
( ~ moref(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
tff(satz65a,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ( ~ moref(X2,X3)
=> eq(X2,X3) )
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65a) ).
tff(satz56,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( eq(X2,X3)
=> ( eq(X4,X5)
=> eq(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz56) ).
tff(c_0_6,negated_conjecture,
~ ( ~ moref(pf(x,z),pf(y,u))
=> eq(pf(x,z),pf(y,u)) ),
inference(assume_negation,[status(cth)],[satz66]) ).
tff(c_0_7,negated_conjecture,
~ ( ~ moref(pf(x,z),pf(y,u))
=> eq(pf(x,z),pf(y,u)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
tff(c_0_8,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( ( ~ moref(X4,X5)
=> eq(X4,X5) )
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
inference(fof_simplification,[status(thm)],[satz65b]) ).
tff(c_0_9,negated_conjecture,
( ~ eq(pf(x,z),pf(y,u))
& ~ moref(pf(x,z),pf(y,u)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
tff(c_0_10,plain,
! [X10: frac,X11: frac,X12: frac,X13: frac] :
( ( ~ moref(X10,X11)
| moref(pf(X10,X12),pf(X11,X13))
| ~ eq(X12,X13) )
& ( ~ moref(X10,X11)
| moref(pf(X10,X12),pf(X11,X13))
| ~ moref(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
tff(c_0_11,plain,
( ~ moref(z,u)
=> eq(z,u) ),
inference(fof_simplification,[status(thm)],[n]) ).
tff(c_0_12,plain,
( ~ moref(x,y)
=> eq(x,y) ),
inference(fof_simplification,[status(thm)],[m]) ).
tcf(c_0_13,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ~ moref(X4,X5)
| ~ eq(X2,X3)
| moref(pf(X4,X2),pf(X5,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tff(c_0_15,plain,
( eq(z,u)
| moref(z,u) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
tcf(c_0_16,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ~ moref(X4,X5)
| ~ moref(X2,X3)
| moref(pf(X4,X2),pf(X5,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tff(c_0_17,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ( ~ moref(X2,X3)
=> eq(X2,X3) )
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
inference(fof_simplification,[status(thm)],[satz65a]) ).
tff(c_0_18,plain,
( eq(x,y)
| moref(x,y) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
tcf(c_0_19,negated_conjecture,
( ~ moref(x,y)
| ~ eq(z,u) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_20,plain,
( eq(z,u)
| moref(z,u) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_21,negated_conjecture,
( ~ moref(z,u)
| ~ moref(x,y) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
tff(c_0_22,plain,
! [X14: frac,X15: frac,X16: frac,X17: frac] :
( ( moref(pf(X14,X16),pf(X15,X17))
| ~ moref(X16,X17)
| ~ eq(X14,X15) )
& ( moref(pf(X14,X16),pf(X15,X17))
| ~ moref(X16,X17)
| ~ moref(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
tcf(c_0_23,plain,
( eq(x,y)
| moref(x,y) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_24,negated_conjecture,
~ moref(x,y),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
tcf(c_0_25,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ~ moref(X4,X5)
| ~ eq(X2,X3)
| moref(pf(X2,X4),pf(X3,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_26,plain,
eq(x,y),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
tff(c_0_27,plain,
! [X6: frac,X7: frac,X8: frac,X9: frac] :
( eq(pf(X6,X8),pf(X7,X9))
| ~ eq(X8,X9)
| ~ eq(X6,X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz56])])]) ).
tcf(c_0_28,negated_conjecture,
~ moref(z,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_25]),c_0_26])]) ).
tcf(c_0_29,negated_conjecture,
~ eq(pf(x,z),pf(y,u)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_30,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ~ eq(X4,X5)
| ~ eq(X2,X3)
| eq(pf(X2,X4),pf(X3,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tcf(c_0_31,plain,
eq(z,u),
inference(sr,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM765_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 03:05:05 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 0.12/0.46 % Version: 3.5.1
% 0.12/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.46 % Starting sh5l with 300s (1) cores
% 0.12/0.46 % new_bool_3 with pid 2114257 completed with status 0
% 0.12/0.46 % Result found by new_bool_3
% 0.12/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.12/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.46 % SubtermCWHack with pid 2114262 completed with status 0
% 0.12/0.46 % Result found by SubtermCWHack
% 0.12/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.12/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.46 % Preprocessing time : 0.001 s
% 0.12/0.46
% 0.12/0.46 % Proof found!
% 0.12/0.46 % SZS status Theorem
% 0.12/0.46 % SZS output start CNFRefutation
% See solution above
% 0.12/0.46 % Parsed axioms : 15
% 0.12/0.46 % Removed by relevancy pruning/SinE : 9
% 0.12/0.46 % Initial clauses : 9
% 0.12/0.46 % Removed in clause preprocessing : 0
% 0.12/0.46 % Initial clauses in saturation : 9
% 0.12/0.46 % Processed clauses : 15
% 0.12/0.46 % ...of these trivial : 0
% 0.12/0.46 % ...subsumed : 1
% 0.12/0.46 % ...remaining for further processing : 14
% 0.12/0.46 % Other redundant clauses eliminated : 0
% 0.12/0.46 % Clauses deleted for lack of memory : 0
% 0.12/0.46 % Backward-subsumed : 2
% 0.12/0.46 % Backward-rewritten : 0
% 0.12/0.46 % Generated clauses : 7
% 0.12/0.46 % ...of the previous two non-redundant : 6
% 0.12/0.46 % ...aggressively subsumed : 0
% 0.12/0.46 % Contextual simplify-reflections : 1
% 0.12/0.46 % Paramodulations : 5
% 0.12/0.46 % Factorizations : 0
% 0.12/0.46 % NegExts : 0
% 0.12/0.46 % Equation resolutions : 0
% 0.12/0.46 % Disequality decompositions : 0
% 0.12/0.46 % Total rewrite steps : 3
% 0.12/0.46 % ...of those cached : 1
% 0.12/0.46 % Propositional unsat checks : 0
% 0.12/0.46 % Propositional check models : 0
% 0.12/0.46 % Propositional check unsatisfiable : 0
% 0.12/0.46 % Propositional clauses : 0
% 0.12/0.46 % Propositional clauses after purity: 0
% 0.12/0.46 % Propositional unsat core size : 0
% 0.12/0.46 % Propositional preprocessing time : 0.000
% 0.12/0.46 % Propositional encoding time : 0.000
% 0.12/0.46 % Propositional solver time : 0.000
% 0.12/0.46 % Success case prop preproc time : 0.000
% 0.12/0.46 % Success case prop encoding time : 0.000
% 0.12/0.46 % Success case prop solver time : 0.000
% 0.12/0.46 % Current number of processed clauses : 10
% 0.12/0.46 % Positive orientable unit clauses : 2
% 0.12/0.46 % Positive unorientable unit clauses: 0
% 0.12/0.46 % Negative unit clauses : 4
% 0.12/0.46 % Non-unit-clauses : 4
% 0.12/0.46 % Current number of unprocessed clauses: 0
% 0.12/0.46 % ...number of literals in the above : 0
% 0.12/0.46 % Current number of archived formulas : 0
% 0.12/0.46 % Current number of archived clauses : 4
% 0.12/0.46 % Clause-clause subsumption calls (NU) : 4
% 0.12/0.46 % Rec. Clause-clause subsumption calls : 4
% 0.12/0.46 % Non-unit clause-clause subsumptions : 2
% 0.12/0.46 % Unit Clause-clause subsumption calls : 4
% 0.12/0.46 % Rewrite failures with RHS unbound : 0
% 0.12/0.46 % BW rewrite match attempts : 0
% 0.12/0.46 % BW rewrite match successes : 0
% 0.12/0.46 % Condensation attempts : 0
% 0.12/0.46 % Condensation successes : 0
% 0.12/0.46 % Termbank termtop insertions : 797
% 0.12/0.46 % Search garbage collected termcells : 113
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.007 s
% 0.12/0.46 % System time : 0.000 s
% 0.12/0.46 % Total time : 0.007 s
% 0.12/0.46 % Maximum resident set size: 3596 pages
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.009 s
% 0.12/0.46 % System time : 0.004 s
% 0.12/0.46 % Total time : 0.013 s
% 0.12/0.46 % Maximum resident set size: 4608 pages
% 0.12/0.46 % E exiting
%------------------------------------------------------------------------------