%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM760^1 : TPTP v9.3.1. Released v3.7.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 : Wed Sep 30 08:17:03 AM UTC 2026
% Result : Theorem 0.30s 0.26s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 75 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 294 ( 35 ~; 31 |; 0 &; 220 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 78 ( 0 ^; 78 !; 0 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
frac: $tType ).
thf(decl_23,type,
x: frac ).
thf(decl_24,type,
y: frac ).
thf(decl_25,type,
z: frac ).
thf(decl_26,type,
u: frac ).
thf(decl_27,type,
moref: frac > frac > $o ).
thf(decl_28,type,
pf: frac > frac > frac ).
thf(decl_29,type,
lessf: frac > frac > $o ).
thf(decl_30,type,
eq: frac > frac > $o ).
thf(satz50,axiom,
! [X1: frac,X2: frac,X3: frac] :
( ( lessf @ X1 @ X2 )
=> ( ( lessf @ X2 @ X3 )
=> ( lessf @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',satz50) ).
thf(satz42,axiom,
! [X1: frac,X2: frac] :
( ( moref @ X1 @ X2 )
=> ( lessf @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',satz42) ).
thf(satz44,axiom,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( moref @ X1 @ X2 )
=> ( ( eq @ X1 @ X3 )
=> ( ( eq @ X2 @ X4 )
=> ( moref @ X3 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',satz44) ).
thf(satz58,axiom,
! [X1: frac,X2: frac] : ( eq @ ( pf @ X1 @ X2 ) @ ( pf @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',satz58) ).
thf(satz61,axiom,
! [X1: frac,X2: frac,X3: frac] :
( ( moref @ X1 @ X2 )
=> ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',satz61) ).
thf(satz64,conjecture,
moref @ ( pf @ x @ z ) @ ( pf @ y @ u ),
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',satz64) ).
thf(satz43,axiom,
! [X1: frac,X2: frac] :
( ( lessf @ X1 @ X2 )
=> ( moref @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',satz43) ).
thf(m,axiom,
moref @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',m) ).
thf(n,axiom,
moref @ z @ u,
file('/export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p',n) ).
thf(c_0_9,plain,
! [X23: frac,X24: frac,X25: frac] :
( ~ ( lessf @ X23 @ X24 )
| ~ ( lessf @ X24 @ X25 )
| ( lessf @ X23 @ X25 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz50])])]) ).
thf(c_0_10,plain,
! [X26: frac,X27: frac] :
( ~ ( moref @ X26 @ X27 )
| ( lessf @ X27 @ X26 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz42])])]) ).
thf(c_0_11,plain,
! [X28: frac,X29: frac,X30: frac,X31: frac] :
( ~ ( moref @ X28 @ X29 )
| ~ ( eq @ X28 @ X30 )
| ~ ( eq @ X29 @ X31 )
| ( moref @ X30 @ X31 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz44])])]) ).
thf(c_0_12,plain,
! [X35: frac,X36: frac] : ( eq @ ( pf @ X35 @ X36 ) @ ( pf @ X36 @ X35 ) ),
inference(variable_rename,[status(thm)],[satz58]) ).
thf(c_0_13,plain,
! [X1: frac,X2: frac,X3: frac] :
( ( lessf @ X1 @ X3 )
| ~ ( lessf @ X1 @ X2 )
| ~ ( lessf @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
! [X1: frac,X2: frac] :
( ( lessf @ X2 @ X1 )
| ~ ( moref @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X32: frac,X33: frac,X34: frac] :
( ~ ( moref @ X32 @ X33 )
| ( moref @ ( pf @ X32 @ X34 ) @ ( pf @ X33 @ X34 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz61])])]) ).
thf(c_0_16,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( moref @ X3 @ X4 )
| ~ ( moref @ X1 @ X2 )
| ~ ( eq @ X1 @ X3 )
| ~ ( eq @ X2 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
! [X2: frac,X1: frac] : ( eq @ ( pf @ X1 @ X2 ) @ ( pf @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X1: frac,X2: frac,X3: frac] :
( ( lessf @ X1 @ X2 )
| ~ ( lessf @ X1 @ X3 )
| ~ ( moref @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
! [X1: frac,X3: frac,X2: frac] :
( ( moref @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X3 ) )
| ~ ( moref @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,plain,
! [X2: frac,X4: frac,X3: frac,X1: frac] :
( ( moref @ X1 @ ( pf @ X2 @ X3 ) )
| ~ ( moref @ X4 @ ( pf @ X3 @ X2 ) )
| ~ ( eq @ X4 @ X1 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_21,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(assume_negation,[status(cth)],[satz64]) ).
thf(c_0_22,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( lessf @ X1 @ ( pf @ X2 @ X3 ) )
| ~ ( lessf @ X1 @ ( pf @ X4 @ X3 ) )
| ~ ( moref @ X2 @ X4 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_23,plain,
! [X1: frac,X2: frac,X4: frac,X3: frac] :
( ( moref @ X1 @ ( pf @ X2 @ X3 ) )
| ~ ( eq @ ( pf @ X4 @ X2 ) @ X1 )
| ~ ( moref @ X4 @ X3 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
thf(c_0_24,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
thf(c_0_25,plain,
! [X21: frac,X22: frac] :
( ~ ( lessf @ X21 @ X22 )
| ( moref @ X22 @ X21 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz43])])]) ).
thf(c_0_26,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( lessf @ X1 @ ( pf @ X2 @ X3 ) )
| ~ ( moref @ ( pf @ X4 @ X3 ) @ X1 )
| ~ ( moref @ X2 @ X4 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
thf(c_0_27,plain,
! [X1: frac,X2: frac,X3: frac] :
( ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X1 @ X3 ) )
| ~ ( moref @ X2 @ X3 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
thf(c_0_28,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
thf(c_0_29,plain,
! [X1: frac,X2: frac] :
( ( moref @ X2 @ X1 )
| ~ ( lessf @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_30,plain,
! [X1: frac,X3: frac,X4: frac,X2: frac] :
( ( lessf @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X4 ) )
| ~ ( moref @ X3 @ X1 )
| ~ ( moref @ X4 @ X2 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_31,negated_conjecture,
~ ( moref @ ( pf @ x @ z ) @ ( pf @ y @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_32,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( moref @ ( pf @ X1 @ X2 ) @ ( pf @ X3 @ X4 ) )
| ~ ( moref @ X1 @ X3 )
| ~ ( moref @ X2 @ X4 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_33,plain,
moref @ x @ y,
inference(split_conjunct,[status(thm)],[m]) ).
thf(c_0_34,plain,
moref @ z @ u,
inference(split_conjunct,[status(thm)],[n]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM760^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n006.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 12:52:54 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.T5tebiMrpg/E---3.1_667710.p
% 0.30/0.26 % Version: 3.5.1-ho
% 0.30/0.26 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.30/0.26 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.26 % Starting full_lambda_5 with 300s (1) cores
% 0.30/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.30/0.26 % new_ho_10 with pid 667723 completed with status 0
% 0.30/0.26 % Result found by new_ho_10
% 0.30/0.26 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.30/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26 % No SInE strategy applied
% 0.30/0.26 % Search class: HHUNF-FFSF22-SFFFFFNN
% 0.30/0.26 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.26 % Starting SubtermCWHack with 151s (1) cores
% 0.30/0.26 % Starting new_ho_10 with 901s (1) cores
% 0.30/0.26 % Starting sh5l with 151s (1) cores
% 0.30/0.26 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.30/0.26 % Starting lpo1_def_fix with 146s (1) cores
% 0.30/0.26 % new_ho_10 with pid 667729 completed with status 0
% 0.30/0.26 % Result found by new_ho_10
% 0.30/0.26 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.30/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.30/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26 % No SInE strategy applied
% 0.30/0.26 % Search class: HHUNF-FFSF22-SFFFFFNN
% 0.30/0.26 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.26 % Starting SubtermCWHack with 151s (1) cores
% 0.30/0.26 % Starting new_ho_10 with 901s (1) cores
% 0.30/0.26 % Preprocessing time : 0.001 s
% 0.30/0.26 % Presaturation interreduction done
% 0.30/0.26
% 0.30/0.26 % Proof found!
% 0.30/0.26 % SZS status Theorem
% 0.30/0.26 % SZS output start CNFRefutation
% See solution above
% 0.30/0.26 % Parsed axioms : 18
% 0.30/0.26 % Removed by relevancy pruning/SinE : 0
% 0.30/0.26 % Initial clauses : 18
% 0.30/0.26 % Removed in clause preprocessing : 9
% 0.30/0.26 % Initial clauses in saturation : 9
% 0.30/0.26 % Processed clauses : 63
% 0.30/0.26 % ...of these trivial : 0
% 0.30/0.26 % ...subsumed : 9
% 0.30/0.26 % ...remaining for further processing : 54
% 0.30/0.26 % Other redundant clauses eliminated : 0
% 0.30/0.26 % Clauses deleted for lack of memory : 0
% 0.30/0.26 % Backward-subsumed : 0
% 0.30/0.26 % Backward-rewritten : 0
% 0.30/0.26 % Generated clauses : 87
% 0.30/0.26 % ...of the previous two non-redundant : 85
% 0.30/0.26 % ...aggressively subsumed : 0
% 0.30/0.26 % Contextual simplify-reflections : 0
% 0.30/0.26 % Paramodulations : 87
% 0.30/0.26 % Factorizations : 0
% 0.30/0.26 % NegExts : 0
% 0.30/0.26 % Equation resolutions : 0
% 0.30/0.26 % Disequality decompositions : 0
% 0.30/0.26 % Total rewrite steps : 2
% 0.30/0.26 % ...of those cached : 0
% 0.30/0.26 % Propositional unsat checks : 0
% 0.30/0.26 % Propositional check models : 0
% 0.30/0.26 % Propositional check unsatisfiable : 0
% 0.30/0.26 % Propositional clauses : 0
% 0.30/0.26 % Propositional clauses after purity: 0
% 0.30/0.26 % Propositional unsat core size : 0
% 0.30/0.26 % Propositional preprocessing time : 0.000
% 0.30/0.26 % Propositional encoding time : 0.000
% 0.30/0.26 % Propositional solver time : 0.000
% 0.30/0.26 % Success case prop preproc time : 0.000
% 0.30/0.26 % Success case prop encoding time : 0.000
% 0.30/0.26 % Success case prop solver time : 0.000
% 0.30/0.26 % Current number of processed clauses : 45
% 0.30/0.26 % Positive orientable unit clauses : 3
% 0.30/0.26 % Positive unorientable unit clauses: 0
% 0.30/0.26 % Negative unit clauses : 1
% 0.30/0.26 % Non-unit-clauses : 41
% 0.30/0.26 % Current number of unprocessed clauses: 35
% 0.30/0.26 % ...number of literals in the above : 121
% 0.30/0.26 % Current number of archived formulas : 0
% 0.30/0.26 % Current number of archived clauses : 9
% 0.30/0.26 % Clause-clause subsumption calls (NU) : 277
% 0.30/0.26 % Rec. Clause-clause subsumption calls : 262
% 0.30/0.26 % Non-unit clause-clause subsumptions : 9
% 0.30/0.26 % Unit Clause-clause subsumption calls : 0
% 0.30/0.26 % Rewrite failures with RHS unbound : 0
% 0.30/0.26 % BW rewrite match attempts : 0
% 0.30/0.26 % BW rewrite match successes : 0
% 0.30/0.26 % Condensation attempts : 63
% 0.30/0.26 % Condensation successes : 0
% 0.30/0.26 % Termbank termtop insertions : 2429
% 0.30/0.26 % Search garbage collected termcells : 140
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.008 s
% 0.30/0.26 % System time : 0.004 s
% 0.30/0.26 % Total time : 0.012 s
% 0.30/0.26 % Maximum resident set size: 3640 pages
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.033 s
% 0.30/0.26 % System time : 0.012 s
% 0.30/0.26 % Total time : 0.045 s
% 0.30/0.26 % Maximum resident set size: 4864 pages
% 0.30/0.26 % E exiting
%------------------------------------------------------------------------------