%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM761_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 : n020.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:34 PM UTC 2026
% Result : Theorem 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 15 ~; 10 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 24 ( 0 sgn 24 !; 0 ?; 24 :)
% 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(satz65a,conjecture,
moref(pf(x,z),pf(y,u)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65a) ).
tff(m,axiom,
( ~ moref(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
tff(satz64,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz64) ).
tff(n,axiom,
moref(z,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
tff(satz62g,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( eq(X2,X3)
=> ( moref(X4,X5)
=> moref(pf(X2,X4),pf(X3,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62g) ).
tff(c_0_5,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(assume_negation,[status(cth)],[satz65a]) ).
tff(c_0_6,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
tff(c_0_7,plain,
( ~ moref(x,y)
=> eq(x,y) ),
inference(fof_simplification,[status(thm)],[m]) ).
tff(c_0_8,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tff(c_0_9,plain,
! [X10: frac,X11: frac,X12: frac,X13: frac] :
( moref(pf(X10,X12),pf(X11,X13))
| ~ moref(X12,X13)
| ~ moref(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz64])])]) ).
tff(c_0_10,plain,
( eq(x,y)
| moref(x,y) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
tcf(c_0_11,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ~ moref(X4,X5)
| ~ moref(X2,X3)
| moref(pf(X2,X4),pf(X3,X5)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_13,plain,
moref(z,u),
inference(split_conjunct,[status(thm)],[n]) ).
tff(c_0_14,plain,
! [X6: frac,X7: frac,X8: frac,X9: frac] :
( moref(pf(X6,X8),pf(X7,X9))
| ~ moref(X8,X9)
| ~ eq(X6,X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz62g])])]) ).
tcf(c_0_15,plain,
( eq(x,y)
| moref(x,y) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_16,negated_conjecture,
~ moref(x,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
tcf(c_0_17,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_14]) ).
tcf(c_0_18,plain,
eq(x,y),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_18]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM761_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n020.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 03:05:02 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 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.21/0.55 % Version: 3.5.1
% 0.21/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 % Starting sh5l with 300s (1) cores
% 0.21/0.55 % new_bool_1 with pid 1863025 completed with status 0
% 0.21/0.55 % Result found by new_bool_1
% 0.21/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.55 % SubtermCWHack with pid 1863032 completed with status 0
% 0.21/0.55 % Result found by SubtermCWHack
% 0.21/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.55 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.55 % Preprocessing time : 0.002 s
% 0.21/0.55
% 0.21/0.55 % Proof found!
% 0.21/0.55 % SZS status Theorem
% 0.21/0.55 % SZS output start CNFRefutation
% See solution above
% 0.21/0.55 % Parsed axioms : 14
% 0.21/0.55 % Removed by relevancy pruning/SinE : 9
% 0.21/0.55 % Initial clauses : 5
% 0.21/0.55 % Removed in clause preprocessing : 0
% 0.21/0.55 % Initial clauses in saturation : 5
% 0.21/0.55 % Processed clauses : 7
% 0.21/0.55 % ...of these trivial : 0
% 0.21/0.55 % ...subsumed : 0
% 0.21/0.55 % ...remaining for further processing : 7
% 0.21/0.55 % Other redundant clauses eliminated : 0
% 0.21/0.55 % Clauses deleted for lack of memory : 0
% 0.21/0.55 % Backward-subsumed : 0
% 0.21/0.55 % Backward-rewritten : 0
% 0.21/0.55 % Generated clauses : 3
% 0.21/0.55 % ...of the previous two non-redundant : 2
% 0.21/0.55 % ...aggressively subsumed : 0
% 0.21/0.55 % Contextual simplify-reflections : 0
% 0.21/0.55 % Paramodulations : 2
% 0.21/0.55 % Factorizations : 0
% 0.21/0.55 % NegExts : 0
% 0.21/0.55 % Equation resolutions : 0
% 0.21/0.55 % Disequality decompositions : 0
% 0.21/0.55 % Total rewrite steps : 3
% 0.21/0.55 % ...of those cached : 1
% 0.21/0.55 % Propositional unsat checks : 0
% 0.21/0.55 % Propositional check models : 0
% 0.21/0.55 % Propositional check unsatisfiable : 0
% 0.21/0.55 % Propositional clauses : 0
% 0.21/0.55 % Propositional clauses after purity: 0
% 0.21/0.55 % Propositional unsat core size : 0
% 0.21/0.55 % Propositional preprocessing time : 0.000
% 0.21/0.55 % Propositional encoding time : 0.000
% 0.21/0.55 % Propositional solver time : 0.000
% 0.21/0.55 % Success case prop preproc time : 0.000
% 0.21/0.55 % Success case prop encoding time : 0.000
% 0.21/0.55 % Success case prop solver time : 0.000
% 0.21/0.55 % Current number of processed clauses : 6
% 0.21/0.55 % Positive orientable unit clauses : 2
% 0.21/0.55 % Positive unorientable unit clauses: 0
% 0.21/0.55 % Negative unit clauses : 2
% 0.21/0.55 % Non-unit-clauses : 2
% 0.21/0.55 % Current number of unprocessed clauses: 0
% 0.21/0.55 % ...number of literals in the above : 0
% 0.21/0.55 % Current number of archived formulas : 0
% 0.21/0.55 % Current number of archived clauses : 1
% 0.21/0.55 % Clause-clause subsumption calls (NU) : 1
% 0.21/0.55 % Rec. Clause-clause subsumption calls : 1
% 0.21/0.55 % Non-unit clause-clause subsumptions : 0
% 0.21/0.55 % Unit Clause-clause subsumption calls : 1
% 0.21/0.55 % Rewrite failures with RHS unbound : 0
% 0.21/0.55 % BW rewrite match attempts : 0
% 0.21/0.55 % BW rewrite match successes : 0
% 0.21/0.55 % Condensation attempts : 0
% 0.21/0.55 % Condensation successes : 0
% 0.21/0.55 % Termbank termtop insertions : 403
% 0.21/0.55 % Search garbage collected termcells : 52
% 0.21/0.55
% 0.21/0.55 % -------------------------------------------------
% 0.21/0.55 % User time : 0.005 s
% 0.21/0.55 % System time : 0.002 s
% 0.21/0.55 % Total time : 0.006 s
% 0.21/0.55 % Maximum resident set size: 3636 pages
% 0.21/0.55
% 0.21/0.55 % -------------------------------------------------
% 0.21/0.55 % User time : 0.005 s
% 0.21/0.55 % System time : 0.007 s
% 0.21/0.55 % Total time : 0.012 s
% 0.21/0.55 % Maximum resident set size: 4864 pages
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------