%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM756_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 : n016.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:32 PM UTC 2026
% Result : Theorem 0.13s 15.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 42 ~; 15 |; 2 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?; 42 :)
% 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,
eq: ( frac * frac ) > $o ).
tff(decl_27,type,
pf: ( frac * frac ) > frac ).
tff(decl_28,type,
lessf: ( frac * frac ) > $o ).
tff(decl_29,type,
moref: ( frac * frac ) > $o ).
tff(satz41b,axiom,
! [X2: frac,X3: frac] :
~ ( ( eq(X2,X3)
=> ~ moref(X2,X3) )
=> ~ ~ ( ( moref(X2,X3)
=> ~ lessf(X2,X3) )
=> ~ ( lessf(X2,X3)
=> ~ eq(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41b) ).
tff(satz62a,axiom,
! [X2: frac,X3: frac,X4: frac] :
( moref(X2,X3)
=> moref(pf(X2,X4),pf(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62a) ).
tff(satz62c,axiom,
! [X2: frac,X3: frac,X4: frac] :
( lessf(X2,X3)
=> lessf(pf(X2,X4),pf(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62c) ).
tff(satz63b,conjecture,
eq(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz63b) ).
tff(satz41a,axiom,
! [X2: frac,X3: frac] :
( ~ eq(X2,X3)
=> ( ~ moref(X2,X3)
=> lessf(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41a) ).
tff(e,axiom,
eq(pf(x,z),pf(y,z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e) ).
tff(c_0_6,plain,
! [X2: frac,X3: frac] :
~ ( ( eq(X2,X3)
=> ~ moref(X2,X3) )
=> ~ ~ ( ( moref(X2,X3)
=> ~ lessf(X2,X3) )
=> ~ ( lessf(X2,X3)
=> ~ eq(X2,X3) ) ) ),
inference(fof_simplification,[status(thm)],[satz41b]) ).
tff(c_0_7,plain,
! [X5: frac,X6: frac] :
( ( ~ eq(X5,X6)
| ~ lessf(X5,X6) )
& ( ~ lessf(X5,X6)
| ~ moref(X5,X6) )
& ( ~ moref(X5,X6)
| ~ eq(X5,X6) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_8,plain,
! [X12: frac,X13: frac,X14: frac] :
( moref(pf(X12,X14),pf(X13,X14))
| ~ moref(X12,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz62a])])]) ).
tff(c_0_9,plain,
! [X9: frac,X10: frac,X11: frac] :
( lessf(pf(X9,X11),pf(X10,X11))
| ~ lessf(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz62c])])]) ).
tff(c_0_10,negated_conjecture,
~ eq(x,y),
inference(assume_negation,[status(cth)],[satz63b]) ).
tcf(c_0_11,plain,
! [X2: frac,X3: frac] :
( ~ moref(X2,X3)
| ~ eq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,plain,
! [X2: frac,X4: frac,X3: frac] :
( ~ moref(X2,X3)
| moref(pf(X2,X4),pf(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_13,plain,
! [X2: frac,X3: frac] :
( ~ eq(X2,X3)
=> ( ~ moref(X2,X3)
=> lessf(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[satz41a]) ).
tcf(c_0_14,plain,
! [X2: frac,X3: frac] :
( ~ eq(X2,X3)
| ~ lessf(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_15,plain,
! [X2: frac,X4: frac,X3: frac] :
( ~ lessf(X2,X3)
| lessf(pf(X2,X4),pf(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tff(c_0_16,negated_conjecture,
~ eq(x,y),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
tcf(c_0_17,plain,
! [X2: frac,X3: frac,X4: frac] :
( ~ eq(pf(X2,X4),pf(X3,X4))
| ~ moref(X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_18,plain,
eq(pf(x,z),pf(y,z)),
inference(split_conjunct,[status(thm)],[e]) ).
tff(c_0_19,plain,
! [X7: frac,X8: frac] :
( lessf(X7,X8)
| moref(X7,X8)
| eq(X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
tcf(c_0_20,plain,
! [X2: frac,X3: frac,X4: frac] :
( ~ eq(pf(X2,X4),pf(X3,X4))
| ~ lessf(X2,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tff(c_0_21,negated_conjecture,
~ eq(x,y),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
tcf(c_0_22,plain,
~ moref(x,y),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_23,plain,
! [X2: frac,X3: frac] :
( lessf(X2,X3)
| moref(X2,X3)
| eq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_24,plain,
~ lessf(x,y),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
tcf(c_0_25,negated_conjecture,
~ eq(x,y),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM756_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.13/15.40 % Computer : n016.cluster.edu
% 0.13/15.40 % Model : x86_64 x86_64
% 0.13/15.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/15.40 % Memory : 8046.5625MB
% 0.13/15.40 % OS : Linux 6.8.0-71-generic
% 0.13/15.40 % CPULimit : 300
% 0.13/15.40 % WCLimit : 300
% 0.13/15.40 % DateTime : Mon Sep 21 03:08:38 UTC 2026
% 0.13/15.40 % CPUTime :
% 0.13/15.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/15.45 Running first-order theorem proving
% 0.13/15.45 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.13/15.47 % Version: 3.5.1
% 0.13/15.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/15.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/15.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/15.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/15.47 % Starting sh5l with 300s (1) cores
% 0.13/15.47 % sh5l with pid 1422283 completed with status 0
% 0.13/15.47 % Result found by sh5l
% 0.13/15.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/15.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/15.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/15.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/15.47 % Starting sh5l with 300s (1) cores
% 0.13/15.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/15.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/15.47 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.13/15.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/15.47 % Starting SubtermCWHack with 31s (1) cores
% 0.13/15.47 % SubtermCWHack with pid 1422289 completed with status 0
% 0.13/15.47 % Result found by SubtermCWHack
% 0.13/15.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/15.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/15.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/15.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/15.47 % Starting sh5l with 300s (1) cores
% 0.13/15.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/15.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/15.47 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.13/15.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/15.47 % Starting SubtermCWHack with 31s (1) cores
% 0.13/15.47 % Preprocessing time : 0.001 s
% 0.13/15.47
% 0.13/15.47 % Proof found!
% 0.13/15.47 % SZS status Theorem
% 0.13/15.47 % SZS output start CNFRefutation
% See solution above
% 0.13/15.47 % Parsed axioms : 15
% 0.13/15.47 % Removed by relevancy pruning/SinE : 9
% 0.13/15.47 % Initial clauses : 8
% 0.13/15.47 % Removed in clause preprocessing : 0
% 0.13/15.47 % Initial clauses in saturation : 8
% 0.13/15.47 % Processed clauses : 12
% 0.13/15.47 % ...of these trivial : 0
% 0.13/15.47 % ...subsumed : 0
% 0.13/15.47 % ...remaining for further processing : 12
% 0.13/15.47 % Other redundant clauses eliminated : 0
% 0.13/15.47 % Clauses deleted for lack of memory : 0
% 0.13/15.47 % Backward-subsumed : 0
% 0.13/15.47 % Backward-rewritten : 0
% 0.13/15.47 % Generated clauses : 8
% 0.13/15.47 % ...of the previous two non-redundant : 5
% 0.13/15.47 % ...aggressively subsumed : 0
% 0.13/15.47 % Contextual simplify-reflections : 0
% 0.13/15.47 % Paramodulations : 8
% 0.13/15.47 % Factorizations : 0
% 0.13/15.47 % NegExts : 0
% 0.13/15.47 % Equation resolutions : 0
% 0.13/15.47 % Disequality decompositions : 0
% 0.13/15.47 % Total rewrite steps : 0
% 0.13/15.47 % ...of those cached : 0
% 0.13/15.47 % Propositional unsat checks : 0
% 0.13/15.47 % Propositional check models : 0
% 0.13/15.47 % Propositional check unsatisfiable : 0
% 0.13/15.47 % Propositional clauses : 0
% 0.13/15.47 % Propositional clauses after purity: 0
% 0.13/15.47 % Propositional unsat core size : 0
% 0.13/15.47 % Propositional preprocessing time : 0.000
% 0.13/15.47 % Propositional encoding time : 0.000
% 0.13/15.47 % Propositional solver time : 0.000
% 0.13/15.47 % Success case prop preproc time : 0.000
% 0.13/15.47 % Success case prop encoding time : 0.000
% 0.13/15.47 % Success case prop solver time : 0.000
% 0.13/15.47 % Current number of processed clauses : 12
% 0.13/15.47 % Positive orientable unit clauses : 1
% 0.13/15.47 % Positive unorientable unit clauses: 0
% 0.13/15.47 % Negative unit clauses : 3
% 0.13/15.47 % Non-unit-clauses : 8
% 0.13/15.47 % Current number of unprocessed clauses: 1
% 0.13/15.47 % ...number of literals in the above : 2
% 0.13/15.47 % Current number of archived formulas : 0
% 0.13/15.47 % Current number of archived clauses : 0
% 0.13/15.47 % Clause-clause subsumption calls (NU) : 4
% 0.13/15.47 % Rec. Clause-clause subsumption calls : 2
% 0.13/15.47 % Non-unit clause-clause subsumptions : 0
% 0.13/15.47 % Unit Clause-clause subsumption calls : 0
% 0.13/15.47 % Rewrite failures with RHS unbound : 0
% 0.13/15.47 % BW rewrite match attempts : 0
% 0.13/15.47 % BW rewrite match successes : 0
% 0.13/15.47 % Condensation attempts : 0
% 0.13/15.47 % Condensation successes : 0
% 0.13/15.47 % Termbank termtop insertions : 708
% 0.13/15.47 % Search garbage collected termcells : 87
% 0.13/15.47
% 0.13/15.47 % -------------------------------------------------
% 0.13/15.47 % User time : 0.003 s
% 0.13/15.47 % System time : 0.003 s
% 0.13/15.47 % Total time : 0.006 s
% 0.13/15.47 % Maximum resident set size: 3640 pages
% 0.13/15.47
% 0.13/15.47 % -------------------------------------------------
% 0.13/15.47 % User time : 0.005 s
% 0.13/15.47 % System time : 0.007 s
% 0.13/15.47 % Total time : 0.012 s
% 0.13/15.47 % Maximum resident set size: 4864 pages
% 0.13/15.47 % E exiting
%------------------------------------------------------------------------------