%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM752^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:37 AM UTC 2026
% Result : Theorem 0.23s 0.35s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 84 ( 8 ~; 4 |; 0 &; 70 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 15 ( 0 ^; 15 !; 0 ?; 15 :)
% 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,
eq: frac > frac > $o ).
thf(decl_27,type,
pf: frac > frac > frac ).
thf(satz62e,conjecture,
eq @ ( pf @ z @ x ) @ ( pf @ z @ y ),
file('/export/starexec/sandbox2/tmp/tmp.1ejEII6Xfy/E---3.1_3096763.p',satz62e) ).
thf(satz56,axiom,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( eq @ X1 @ X2 )
=> ( ( eq @ X3 @ X4 )
=> ( eq @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1ejEII6Xfy/E---3.1_3096763.p',satz56) ).
thf(satz37,axiom,
! [X1: frac] : ( eq @ X1 @ X1 ),
file('/export/starexec/sandbox2/tmp/tmp.1ejEII6Xfy/E---3.1_3096763.p',satz37) ).
thf(e,axiom,
eq @ x @ y,
file('/export/starexec/sandbox2/tmp/tmp.1ejEII6Xfy/E---3.1_3096763.p',e) ).
thf(c_0_4,negated_conjecture,
~ ( eq @ ( pf @ z @ x ) @ ( pf @ z @ y ) ),
inference(assume_negation,[status(cth)],[satz62e]) ).
thf(c_0_5,negated_conjecture,
~ ( eq @ ( pf @ z @ x ) @ ( pf @ z @ y ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
~ ( eq @ ( pf @ z @ x ) @ ( pf @ z @ y ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_7,plain,
! [X10: frac,X11: frac,X12: frac,X13: frac] :
( ~ ( eq @ X10 @ X11 )
| ~ ( eq @ X12 @ X13 )
| ( eq @ ( pf @ X10 @ X12 ) @ ( pf @ X11 @ X13 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz56])])]) ).
thf(c_0_8,plain,
! [X14: frac] : ( eq @ X14 @ X14 ),
inference(variable_rename,[status(thm)],[satz37]) ).
thf(c_0_9,negated_conjecture,
~ ( eq @ ( pf @ z @ x ) @ ( pf @ z @ y ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( ( eq @ ( pf @ X1 @ X3 ) @ ( pf @ X2 @ X4 ) )
| ~ ( eq @ X1 @ X2 )
| ~ ( eq @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
eq @ x @ y,
inference(split_conjunct,[status(thm)],[e]) ).
thf(c_0_12,plain,
! [X1: frac] : ( eq @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM752^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n008.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 12:50:39 UTC 2026
% 0.10/0.25 % CPUTime :
% 0.10/0.25 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.32 Running higher-order theorem proving
% 0.23/0.33 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.1ejEII6Xfy/E---3.1_3096763.p
% 0.23/0.35 % Version: 3.5.1-ho
% 0.23/0.35 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.23/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.35 % Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.35 % Starting sh4l with 300s (1) cores
% 0.23/0.35 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.23/0.35 % new_ho_10 with pid 3096776 completed with status 0
% 0.23/0.35 % Result found by new_ho_10
% 0.23/0.35 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.23/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.35 % No SInE strategy applied
% 0.23/0.35 % Search class: HHUNF-FFSF22-SFFFFFNN
% 0.23/0.35 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.35 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.35 % Starting new_ho_10 with 901s (1) cores
% 0.23/0.35 % Starting sh5l with 151s (1) cores
% 0.23/0.35 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.23/0.35 % Starting lpo1_def_fix with 146s (1) cores
% 0.23/0.35 % new_ho_10 with pid 3096781 completed with status 0
% 0.23/0.35 % Result found by new_ho_10
% 0.23/0.35 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.23/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.35 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.35 % No SInE strategy applied
% 0.23/0.35 % Search class: HHUNF-FFSF22-SFFFFFNN
% 0.23/0.35 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.35 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.35 % Starting new_ho_10 with 901s (1) cores
% 0.23/0.35 % Preprocessing time : 0.001 s
% 0.23/0.35 % Presaturation interreduction done
% 0.23/0.35
% 0.23/0.35 % Proof found!
% 0.23/0.35 % SZS status Theorem
% 0.23/0.35 % SZS output start CNFRefutation
% See solution above
% 0.23/0.35 % Parsed axioms : 10
% 0.23/0.35 % Removed by relevancy pruning/SinE : 0
% 0.23/0.35 % Initial clauses : 10
% 0.23/0.35 % Removed in clause preprocessing : 6
% 0.23/0.35 % Initial clauses in saturation : 4
% 0.23/0.35 % Processed clauses : 8
% 0.23/0.35 % ...of these trivial : 0
% 0.23/0.35 % ...subsumed : 0
% 0.23/0.35 % ...remaining for further processing : 8
% 0.23/0.35 % Other redundant clauses eliminated : 0
% 0.23/0.35 % Clauses deleted for lack of memory : 0
% 0.23/0.35 % Backward-subsumed : 0
% 0.23/0.35 % Backward-rewritten : 0
% 0.23/0.35 % Generated clauses : 1
% 0.23/0.35 % ...of the previous two non-redundant : 0
% 0.23/0.35 % ...aggressively subsumed : 0
% 0.23/0.35 % Contextual simplify-reflections : 0
% 0.23/0.35 % Paramodulations : 1
% 0.23/0.35 % Factorizations : 0
% 0.23/0.35 % NegExts : 0
% 0.23/0.35 % Equation resolutions : 0
% 0.23/0.35 % Disequality decompositions : 0
% 0.23/0.35 % Total rewrite steps : 2
% 0.23/0.35 % ...of those cached : 0
% 0.23/0.35 % Propositional unsat checks : 0
% 0.23/0.35 % Propositional check models : 0
% 0.23/0.35 % Propositional check unsatisfiable : 0
% 0.23/0.35 % Propositional clauses : 0
% 0.23/0.35 % Propositional clauses after purity: 0
% 0.23/0.35 % Propositional unsat core size : 0
% 0.23/0.35 % Propositional preprocessing time : 0.000
% 0.23/0.35 % Propositional encoding time : 0.000
% 0.23/0.35 % Propositional solver time : 0.000
% 0.23/0.35 % Success case prop preproc time : 0.000
% 0.23/0.35 % Success case prop encoding time : 0.000
% 0.23/0.35 % Success case prop solver time : 0.000
% 0.23/0.35 % Current number of processed clauses : 4
% 0.23/0.35 % Positive orientable unit clauses : 2
% 0.23/0.35 % Positive unorientable unit clauses: 0
% 0.23/0.35 % Negative unit clauses : 1
% 0.23/0.35 % Non-unit-clauses : 1
% 0.23/0.35 % Current number of unprocessed clauses: 0
% 0.23/0.35 % ...number of literals in the above : 0
% 0.23/0.35 % Current number of archived formulas : 0
% 0.23/0.35 % Current number of archived clauses : 4
% 0.23/0.35 % Clause-clause subsumption calls (NU) : 2
% 0.23/0.35 % Rec. Clause-clause subsumption calls : 2
% 0.23/0.35 % Non-unit clause-clause subsumptions : 0
% 0.23/0.35 % Unit Clause-clause subsumption calls : 0
% 0.23/0.35 % Rewrite failures with RHS unbound : 0
% 0.23/0.35 % BW rewrite match attempts : 4
% 0.23/0.35 % BW rewrite match successes : 0
% 0.23/0.35 % Condensation attempts : 8
% 0.23/0.35 % Condensation successes : 0
% 0.23/0.35 % Termbank termtop insertions : 372
% 0.23/0.35 % Search garbage collected termcells : 41
% 0.23/0.35
% 0.23/0.35 % -------------------------------------------------
% 0.23/0.35 % User time : 0.004 s
% 0.23/0.35 % System time : 0.002 s
% 0.23/0.35 % Total time : 0.007 s
% 0.23/0.35 % Maximum resident set size: 3632 pages
% 0.23/0.35
% 0.23/0.35 % -------------------------------------------------
% 0.23/0.35 % User time : 0.009 s
% 0.23/0.35 % System time : 0.011 s
% 0.23/0.35 % Total time : 0.020 s
% 0.23/0.35 % Maximum resident set size: 4864 pages
% 0.23/0.35 % E exiting
%------------------------------------------------------------------------------