%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM762_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 : n015.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:56:29 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 79 ( 37 ~; 32 |; 0 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 70 ( 0 sgn 70 !; 0 ?; 70 :)
% 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(satz65b,conjecture,
moref(pf(x,z),pf(y,u)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65b) ).
tff(satz44,axiom,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( moref(X2,X3)
=> ( eq(X2,X4)
=> ( eq(X3,X5)
=> moref(X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz44) ).
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(satz61,axiom,
! [X2: frac,X3: frac,X4: frac] :
( moref(X2,X3)
=> moref(pf(X2,X4),pf(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz61) ).
tff(n,axiom,
( ~ moref(z,u)
=> eq(z,u) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
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(satz37,axiom,
! [X2: frac] : eq(X2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).
tff(m,axiom,
moref(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
tff(c_0_8,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(assume_negation,[status(cth)],[satz65b]) ).
tff(c_0_9,plain,
! [X6: frac,X7: frac,X8: frac,X9: frac] :
( moref(X8,X9)
| ~ eq(X7,X9)
| ~ eq(X6,X8)
| ~ moref(X6,X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz44])])]) ).
tff(c_0_10,plain,
! [X14: frac,X15: frac,X16: frac,X17: frac] :
( eq(pf(X14,X16),pf(X15,X17))
| ~ eq(X16,X17)
| ~ eq(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz56])])]) ).
tff(c_0_11,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
tcf(c_0_12,plain,
! [X2: frac,X3: frac,X4: frac,X5: frac] :
( ~ eq(X3,X5)
| ~ eq(X2,X4)
| ~ moref(X2,X3)
| moref(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_13,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_10]) ).
tff(c_0_14,plain,
! [X10: frac,X11: frac,X12: frac] :
( moref(pf(X10,X12),pf(X11,X12))
| ~ moref(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz61])])]) ).
tff(c_0_15,plain,
( ~ moref(z,u)
=> eq(z,u) ),
inference(fof_simplification,[status(thm)],[n]) ).
tff(c_0_16,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
tff(c_0_17,plain,
! [X18: frac,X19: frac,X20: frac,X21: frac] :
( moref(pf(X18,X20),pf(X19,X21))
| ~ moref(X20,X21)
| ~ moref(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz64])])]) ).
tcf(c_0_18,plain,
! [X2: frac,X4: frac,X3: frac,X5: frac,X7: frac,X6: frac] :
( ~ moref(X5,pf(X7,X6))
| ~ eq(X7,X3)
| ~ eq(X6,X4)
| ~ eq(X5,X2)
| moref(X2,pf(X3,X4)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_19,plain,
! [X2: frac,X4: frac,X3: frac] :
( ~ moref(X2,X3)
| moref(pf(X2,X4),pf(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tff(c_0_20,plain,
! [X13: frac] : eq(X13,X13),
inference(variable_rename,[status(thm)],[satz37]) ).
tff(c_0_21,plain,
( eq(z,u)
| moref(z,u) ),
inference(fof_nnf,[status(thm)],[c_0_15]) ).
tcf(c_0_22,negated_conjecture,
~ moref(pf(x,z),pf(y,u)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_23,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_17]) ).
tcf(c_0_24,plain,
moref(x,y),
inference(split_conjunct,[status(thm)],[m]) ).
tcf(c_0_25,plain,
! [X2: frac,X4: frac,X3: frac,X5: frac,X6: frac,X7: frac] :
( ~ moref(X5,X7)
| ~ eq(X7,X3)
| ~ eq(X6,X4)
| ~ eq(pf(X5,X6),X2)
| moref(X2,pf(X3,X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
tcf(c_0_26,plain,
! [X2: frac] : eq(X2,X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_27,plain,
( eq(z,u)
| moref(z,u) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_28,negated_conjecture,
~ moref(z,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
tcf(c_0_29,plain,
! [X2: frac,X4: frac,X5: frac,X3: frac,X6: frac] :
( ~ moref(X2,X6)
| ~ eq(X6,X4)
| ~ eq(X3,X5)
| moref(pf(X2,X3),pf(X4,X5)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
tcf(c_0_30,plain,
eq(z,u),
inference(sr,[status(thm)],[c_0_27,c_0_28]) ).
tcf(c_0_31,plain,
! [X2: frac,X3: frac,X4: frac] :
( ~ moref(X2,X4)
| ~ eq(X4,X3)
| moref(pf(X2,z),pf(X3,u)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
tcf(c_0_32,plain,
! [X2: frac,X3: frac] :
( ~ moref(X2,X3)
| moref(pf(X2,z),pf(X3,u)) ),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM762_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n015.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 03:07:51 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 422542 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 422547 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44 % Presaturation interreduction done
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 17
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 17
% 0.10/0.44 % Removed in clause preprocessing : 9
% 0.10/0.44 % Initial clauses in saturation : 8
% 0.10/0.44 % Processed clauses : 49
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 5
% 0.10/0.44 % ...remaining for further processing : 44
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 0
% 0.10/0.44 % Generated clauses : 61
% 0.10/0.44 % ...of the previous two non-redundant : 59
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 60
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 2
% 0.10/0.44 % ...of those cached : 1
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 35
% 0.10/0.44 % Positive orientable unit clauses : 3
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 3
% 0.10/0.44 % Non-unit-clauses : 29
% 0.10/0.44 % Current number of unprocessed clauses: 24
% 0.10/0.44 % ...number of literals in the above : 112
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 9
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 256
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 207
% 0.10/0.44 % Non-unit clause-clause subsumptions : 3
% 0.10/0.44 % Unit Clause-clause subsumption calls : 2
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 1
% 0.10/0.44 % BW rewrite match successes : 0
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 1912
% 0.10/0.44 % Search garbage collected termcells : 91
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.005 s
% 0.10/0.44 % System time : 0.001 s
% 0.10/0.44 % Total time : 0.007 s
% 0.10/0.44 % Maximum resident set size: 3640 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.014 s
% 0.10/0.44 % System time : 0.009 s
% 0.10/0.44 % Total time : 0.024 s
% 0.10/0.44 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------