%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO357^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:42:49 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 28 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 91 ( 22 ~; 21 |; 11 &; 28 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 5 con; 0-1 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
atype: $tType ).
thf(decl_23,type,
a: $o ).
thf(decl_24,type,
v: atype ).
thf(decl_25,type,
u: atype ).
thf(decl_26,type,
b: $o ).
thf(decl_27,type,
epred1_0: atype > $o ).
thf(cE2LEIBEQ2_pme,conjecture,
( ! [X1: atype > $o] :
( ( ( a
| ~ a )
& ( X1 @ u ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) )
=> ! [X2: atype > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
file('/export/starexec/sandbox/tmp/tmp.M1TceSNf1i/E---3.1_333437.p',cE2LEIBEQ2_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: atype > $o] :
( ( ( a
| ~ a )
& ( X1 @ u ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) )
=> ! [X2: atype > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
inference(assume_negation,[status(cth)],[cE2LEIBEQ2_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X1: atype > $o] :
( ( ( a
| ~ a )
& ( X1 @ u ) )
=> ( ( b
| ~ b )
& ( X1 @ v ) ) )
=> ! [X2: atype > $o] :
( ( X2 @ u )
=> ( X2 @ v ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X5: atype > $o] :
( ( b
| ~ b
| ~ a
| ~ ( X5 @ u ) )
& ( ( X5 @ v )
| ~ a
| ~ ( X5 @ u ) )
& ( b
| ~ b
| a
| ~ ( X5 @ u ) )
& ( ( X5 @ v )
| a
| ~ ( X5 @ u ) )
& ( epred1_0 @ u )
& ~ ( epred1_0 @ v ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X1: atype > $o] :
( ( X1 @ v )
| a
| ~ ( X1 @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
epred1_0 @ u,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
~ ( epred1_0 @ v ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X1: atype > $o] :
( ( X1 @ v )
| ~ a
| ~ ( X1 @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
a,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: atype > $o] :
( ( X1 @ v )
| ~ ( X1 @ u ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_5]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO357^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n011.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Tue Sep 29 16:48:46 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/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.M1TceSNf1i/E---3.1_333437.p
% 0.07/0.25 % Version: 3.5.1-ho
% 0.07/0.25 % Preprocessing class: HSSSSLSSSSSNSSA.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.25 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.07/0.25 % Starting sh5l with 300s (1) cores
% 0.07/0.25 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.25 % ehoh_best_sine_rwall with pid 333451 completed with status 0
% 0.07/0.25 % Result found by ehoh_best_sine_rwall
% 0.07/0.25 % Preprocessing class: HSSSSLSSSSSNSSA.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.25 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.07/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.25 % Search class: HGUNF-FFSF00-SSSFFMBN
% 0.07/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.25 % SubtermCWHack with pid 333459 completed with status 0
% 0.07/0.25 % Result found by SubtermCWHack
% 0.07/0.25 % Preprocessing class: HSSSSLSSSSSNSSA.
% 0.07/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.25 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.25 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.07/0.25 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.25 % Search class: HGUNF-FFSF00-SSSFFMBN
% 0.07/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.25 % Preprocessing time : 0.001 s
% 0.07/0.25
% 0.07/0.25 % Proof found!
% 0.07/0.25 % SZS status Theorem
% 0.07/0.25 % SZS output start CNFRefutation
% See solution above
% 0.07/0.25 % Parsed axioms : 6
% 0.07/0.25 % Removed by relevancy pruning/SinE : 5
% 0.07/0.25 % Initial clauses : 6
% 0.07/0.25 % Removed in clause preprocessing : 2
% 0.07/0.25 % Initial clauses in saturation : 4
% 0.07/0.25 % Processed clauses : 5
% 0.07/0.25 % ...of these trivial : 0
% 0.07/0.25 % ...subsumed : 0
% 0.07/0.25 % ...remaining for further processing : 5
% 0.07/0.25 % Other redundant clauses eliminated : 0
% 0.07/0.25 % Clauses deleted for lack of memory : 0
% 0.07/0.25 % Backward-subsumed : 0
% 0.07/0.25 % Backward-rewritten : 1
% 0.07/0.25 % Generated clauses : 2
% 0.07/0.25 % ...of the previous two non-redundant : 1
% 0.07/0.25 % ...aggressively subsumed : 0
% 0.07/0.25 % Contextual simplify-reflections : 0
% 0.07/0.25 % Paramodulations : 2
% 0.07/0.25 % Factorizations : 0
% 0.07/0.25 % NegExts : 0
% 0.07/0.25 % Equation resolutions : 0
% 0.07/0.25 % Disequality decompositions : 0
% 0.07/0.25 % Total rewrite steps : 2
% 0.07/0.25 % ...of those cached : 1
% 0.07/0.25 % Propositional unsat checks : 0
% 0.07/0.25 % Propositional check models : 0
% 0.07/0.25 % Propositional check unsatisfiable : 0
% 0.07/0.25 % Propositional clauses : 0
% 0.07/0.25 % Propositional clauses after purity: 0
% 0.07/0.25 % Propositional unsat core size : 0
% 0.07/0.25 % Propositional preprocessing time : 0.000
% 0.07/0.25 % Propositional encoding time : 0.000
% 0.07/0.25 % Propositional solver time : 0.000
% 0.07/0.25 % Success case prop preproc time : 0.000
% 0.07/0.25 % Success case prop encoding time : 0.000
% 0.07/0.25 % Success case prop solver time : 0.000
% 0.07/0.25 % Current number of processed clauses : 4
% 0.07/0.25 % Positive orientable unit clauses : 2
% 0.07/0.25 % Positive unorientable unit clauses: 0
% 0.07/0.25 % Negative unit clauses : 1
% 0.07/0.25 % Non-unit-clauses : 1
% 0.07/0.25 % Current number of unprocessed clauses: 0
% 0.07/0.25 % ...number of literals in the above : 0
% 0.07/0.25 % Current number of archived formulas : 0
% 0.07/0.25 % Current number of archived clauses : 1
% 0.07/0.25 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.25 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.25 % Non-unit clause-clause subsumptions : 0
% 0.07/0.25 % Unit Clause-clause subsumption calls : 0
% 0.07/0.25 % Rewrite failures with RHS unbound : 0
% 0.07/0.25 % BW rewrite match attempts : 1
% 0.07/0.25 % BW rewrite match successes : 1
% 0.07/0.25 % Condensation attempts : 0
% 0.07/0.25 % Condensation successes : 0
% 0.07/0.25 % Termbank termtop insertions : 472
% 0.07/0.25 % Search garbage collected termcells : 120
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.003 s
% 0.07/0.25 % System time : 0.002 s
% 0.07/0.25 % Total time : 0.005 s
% 0.07/0.25 % Maximum resident set size: 3628 pages
% 0.07/0.25
% 0.07/0.25 % -------------------------------------------------
% 0.07/0.25 % User time : 0.004 s
% 0.07/0.25 % System time : 0.007 s
% 0.07/0.25 % Total time : 0.011 s
% 0.07/0.25 % Maximum resident set size: 4864 pages
% 0.07/0.25 % E exiting
%------------------------------------------------------------------------------