%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM746^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 : 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 : Wed Sep 30 08:16:59 AM UTC 2026
% Result : Theorem 0.11s 0.27s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 83 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 253 ( 40 ~; 25 |; 3 &; 164 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 ^; 39 !; 0 ?; 39 :)
% 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,
lessf: frac > frac > $o ).
thf(decl_27,type,
eq: frac > frac > $o ).
thf(satz52,conjecture,
( ~ ( lessf @ x @ z )
=> ( eq @ x @ z ) ),
file('/export/starexec/sandbox/tmp/tmp.LRnaB3BfxZ/E---3.1_3471635.p',satz52) ).
thf(satz51b,axiom,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X3 )
=> ( ( ~ ( lessf @ X3 @ X4 )
=> ( eq @ X3 @ X4 ) )
=> ( lessf @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LRnaB3BfxZ/E---3.1_3471635.p',satz51b) ).
thf(k,axiom,
( ~ ( lessf @ y @ z )
=> ( eq @ y @ z ) ),
file('/export/starexec/sandbox/tmp/tmp.LRnaB3BfxZ/E---3.1_3471635.p',k) ).
thf(l,axiom,
( ~ ( lessf @ x @ y )
=> ( eq @ x @ y ) ),
file('/export/starexec/sandbox/tmp/tmp.LRnaB3BfxZ/E---3.1_3471635.p',l) ).
thf(satz51a,axiom,
! [X2: frac,X3: frac,X4: frac] :
( ( ~ ( lessf @ X2 @ X3 )
=> ( eq @ X2 @ X3 ) )
=> ( ( lessf @ X3 @ X4 )
=> ( lessf @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LRnaB3BfxZ/E---3.1_3471635.p',satz51a) ).
thf(satz39,axiom,
! [X2: frac,X3: frac,X4: frac] :
( ( eq @ X2 @ X3 )
=> ( ( eq @ X3 @ X4 )
=> ( eq @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LRnaB3BfxZ/E---3.1_3471635.p',satz39) ).
thf(c_0_6,negated_conjecture,
~ ( ~ ( lessf @ x @ z )
=> ( eq @ x @ z ) ),
inference(assume_negation,[status(cth)],[satz52]) ).
thf(c_0_7,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X3 )
=> ( ( ~ ( lessf @ X3 @ X4 )
=> ( eq @ X3 @ X4 ) )
=> ( lessf @ X2 @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[satz51b]) ).
thf(c_0_8,plain,
( ~ ( lessf @ y @ z )
=> ( eq @ y @ z ) ),
inference(fof_simplification,[status(thm)],[k]) ).
thf(c_0_9,negated_conjecture,
~ ( ~ ( lessf @ x @ z )
=> ( eq @ x @ z ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X18: frac,X19: frac,X20: frac] :
( ( ~ ( lessf @ X19 @ X20 )
| ( lessf @ X18 @ X20 )
| ~ ( lessf @ X18 @ X19 ) )
& ( ~ ( eq @ X19 @ X20 )
| ( lessf @ X18 @ X20 )
| ~ ( lessf @ X18 @ X19 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
thf(c_0_11,plain,
( ( lessf @ y @ z )
| ( eq @ y @ z ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
( ~ ( lessf @ x @ y )
=> ( eq @ x @ y ) ),
inference(fof_simplification,[status(thm)],[l]) ).
thf(c_0_13,negated_conjecture,
( ~ ( lessf @ x @ z )
& ~ ( eq @ x @ z ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
thf(c_0_14,plain,
! [X4: frac,X3: frac,X2: frac] :
( ( lessf @ X4 @ X3 )
| ~ ( eq @ X2 @ X3 )
| ~ ( lessf @ X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
( ( lessf @ y @ z )
| ( eq @ y @ z ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,plain,
! [X4: frac,X3: frac,X2: frac] :
( ( lessf @ X4 @ X3 )
| ~ ( lessf @ X2 @ X3 )
| ~ ( lessf @ X4 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_17,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( ~ ( lessf @ X2 @ X3 )
=> ( eq @ X2 @ X3 ) )
=> ( ( lessf @ X3 @ X4 )
=> ( lessf @ X2 @ X4 ) ) ),
inference(fof_simplification,[status(thm)],[satz51a]) ).
thf(c_0_18,plain,
( ( lessf @ x @ y )
| ( eq @ x @ y ) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
~ ( lessf @ x @ z ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_20,plain,
! [X2: frac] :
( ( lessf @ X2 @ z )
| ~ ( lessf @ X2 @ y ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_21,plain,
! [X21: frac,X22: frac,X23: frac] :
( ( ~ ( lessf @ X21 @ X22 )
| ~ ( lessf @ X22 @ X23 )
| ( lessf @ X21 @ X23 ) )
& ( ~ ( eq @ X21 @ X22 )
| ~ ( lessf @ X22 @ X23 )
| ( lessf @ X21 @ X23 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
thf(c_0_22,plain,
( ( lessf @ x @ y )
| ( eq @ x @ y ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,negated_conjecture,
~ ( lessf @ x @ y ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_24,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( lessf @ X2 @ X4 )
| ~ ( eq @ X2 @ X3 )
| ~ ( lessf @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_25,plain,
eq @ x @ y,
inference(sr,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,plain,
! [X2: frac] :
( ( lessf @ x @ X2 )
| ~ ( lessf @ y @ X2 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_27,plain,
! [X15: frac,X16: frac,X17: frac] :
( ~ ( eq @ X15 @ X16 )
| ~ ( eq @ X16 @ X17 )
| ( eq @ X15 @ X17 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz39])])]) ).
thf(c_0_28,negated_conjecture,
~ ( lessf @ y @ z ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
thf(c_0_29,plain,
! [X2: frac,X3: frac,X4: frac] :
( ( eq @ X2 @ X4 )
| ~ ( eq @ X2 @ X3 )
| ~ ( eq @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,plain,
eq @ y @ z,
inference(sr,[status(thm)],[c_0_15,c_0_28]) ).
thf(c_0_31,negated_conjecture,
~ ( eq @ x @ z ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_32,plain,
! [X2: frac] :
( ( eq @ X2 @ z )
| ~ ( eq @ X2 @ y ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM746^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.19 % Computer : n015.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Tue Sep 29 12:51:17 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.23 Running higher-order theorem proving
% 0.11/0.25 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.LRnaB3BfxZ/E---3.1_3471635.p
% 0.11/0.27 % Version: 3.5.1-ho
% 0.11/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.11/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.27 % Starting full_lambda_5 with 300s (1) cores
% 0.11/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.11/0.27 % new_ho_10_unif with pid 3471651 completed with status 0
% 0.11/0.27 % Result found by new_ho_10_unif
% 0.11/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.11/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.27 % Starting full_lambda_5 with 300s (1) cores
% 0.11/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.11/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.27 % No SInE strategy applied
% 0.11/0.27 % Search class: HGUNF-FFSF00-SFFFFFNN
% 0.11/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.27 % SubtermCWHack with pid 3471652 completed with status 0
% 0.11/0.27 % Result found by SubtermCWHack
% 0.11/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.11/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.11/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.27 % Starting full_lambda_5 with 300s (1) cores
% 0.11/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.11/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.27 % No SInE strategy applied
% 0.11/0.27 % Search class: HGUNF-FFSF00-SFFFFFNN
% 0.11/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.27 % Preprocessing time : 0.001 s
% 0.11/0.27
% 0.11/0.27 % Proof found!
% 0.11/0.27 % SZS status Theorem
% 0.11/0.27 % SZS output start CNFRefutation
% See solution above
% 0.11/0.27 % Parsed axioms : 13
% 0.11/0.27 % Removed by relevancy pruning/SinE : 0
% 0.11/0.27 % Initial clauses : 16
% 0.11/0.27 % Removed in clause preprocessing : 7
% 0.11/0.27 % Initial clauses in saturation : 9
% 0.11/0.27 % Processed clauses : 26
% 0.11/0.27 % ...of these trivial : 0
% 0.11/0.27 % ...subsumed : 4
% 0.11/0.27 % ...remaining for further processing : 22
% 0.11/0.27 % Other redundant clauses eliminated : 0
% 0.11/0.27 % Clauses deleted for lack of memory : 0
% 0.11/0.27 % Backward-subsumed : 0
% 0.11/0.27 % Backward-rewritten : 0
% 0.11/0.27 % Generated clauses : 27
% 0.11/0.27 % ...of the previous two non-redundant : 23
% 0.11/0.27 % ...aggressively subsumed : 0
% 0.11/0.27 % Contextual simplify-reflections : 2
% 0.11/0.27 % Paramodulations : 25
% 0.11/0.27 % Factorizations : 0
% 0.11/0.27 % NegExts : 0
% 0.11/0.27 % Equation resolutions : 0
% 0.11/0.27 % Disequality decompositions : 0
% 0.11/0.27 % Total rewrite steps : 1
% 0.11/0.27 % ...of those cached : 0
% 0.11/0.27 % Propositional unsat checks : 0
% 0.11/0.27 % Propositional check models : 0
% 0.11/0.27 % Propositional check unsatisfiable : 0
% 0.11/0.27 % Propositional clauses : 0
% 0.11/0.27 % Propositional clauses after purity: 0
% 0.11/0.27 % Propositional unsat core size : 0
% 0.11/0.27 % Propositional preprocessing time : 0.000
% 0.11/0.27 % Propositional encoding time : 0.000
% 0.11/0.27 % Propositional solver time : 0.000
% 0.11/0.27 % Success case prop preproc time : 0.000
% 0.11/0.27 % Success case prop encoding time : 0.000
% 0.11/0.27 % Success case prop solver time : 0.000
% 0.11/0.27 % Current number of processed clauses : 20
% 0.11/0.27 % Positive orientable unit clauses : 2
% 0.11/0.27 % Positive unorientable unit clauses: 0
% 0.11/0.27 % Negative unit clauses : 7
% 0.11/0.27 % Non-unit-clauses : 11
% 0.11/0.27 % Current number of unprocessed clauses: 2
% 0.11/0.27 % ...number of literals in the above : 6
% 0.11/0.27 % Current number of archived formulas : 0
% 0.11/0.27 % Current number of archived clauses : 2
% 0.11/0.27 % Clause-clause subsumption calls (NU) : 11
% 0.11/0.27 % Rec. Clause-clause subsumption calls : 11
% 0.11/0.27 % Non-unit clause-clause subsumptions : 5
% 0.11/0.27 % Unit Clause-clause subsumption calls : 20
% 0.11/0.27 % Rewrite failures with RHS unbound : 0
% 0.11/0.27 % BW rewrite match attempts : 0
% 0.11/0.27 % BW rewrite match successes : 0
% 0.11/0.27 % Condensation attempts : 0
% 0.11/0.27 % Condensation successes : 0
% 0.11/0.27 % Termbank termtop insertions : 1105
% 0.11/0.27 % Search garbage collected termcells : 150
% 0.11/0.27
% 0.11/0.27 % -------------------------------------------------
% 0.11/0.27 % User time : 0.003 s
% 0.11/0.27 % System time : 0.003 s
% 0.11/0.27 % Total time : 0.006 s
% 0.11/0.27 % Maximum resident set size: 3636 pages
% 0.11/0.27
% 0.11/0.27 % -------------------------------------------------
% 0.11/0.27 % User time : 0.003 s
% 0.11/0.27 % System time : 0.009 s
% 0.11/0.27 % Total time : 0.012 s
% 0.11/0.27 % Maximum resident set size: 4864 pages
% 0.11/0.27 % E exiting
%------------------------------------------------------------------------------