%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO068^4.001 : 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 : n016.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:17 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 36 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 109 ( 16 equ; 0 cnn)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 212 ( 31 ~; 31 |; 3 &; 137 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 2 con; 0-3 aty)
% Number of variables : 66 ( 34 ^; 32 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
irel: $i > $i > $o ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_29,type,
iatom: ( $i > $o ) > $i > $o ).
thf(decl_35,type,
iimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
ivalid: ( $i > $o ) > $o ).
thf(decl_43,type,
p0: $i > $o ).
thf(decl_44,type,
p1: $i > $o ).
thf(decl_45,type,
esk1_1: $i > $i ).
thf(decl_46,type,
esk2_2: $i > $i > $i ).
thf(decl_47,type,
esk3_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X10: $i > $o,X11: $i > $o] : ( mor @ ( mnot @ X10 ) @ X11 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X5: $i] :
~ ( X4 @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X5: $i] :
( ( X6 @ X5 )
| ( X7 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',mor) ).
thf(iimplies,axiom,
( iimplies
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mimplies @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',iimplies) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X12: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X12 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',mbox_s4) ).
thf(iatom,axiom,
( iatom
= ( ^ [X12: $i > $o] : X12 ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',iatom) ).
thf(ivalid,axiom,
( ivalid
= ( ^ [X15: $i > $o] :
! [X13: $i] : ( X15 @ X13 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',ivalid) ).
thf(axiom2,axiom,
ivalid @ ( iimplies @ ( iatom @ p1 ) @ ( iimplies @ ( iatom @ p1 ) @ ( iatom @ p0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',axiom2) ).
thf(axiom1,axiom,
ivalid @ ( iatom @ p1 ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',axiom1) ).
thf(con,conjecture,
ivalid @ ( iatom @ p0 ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',con) ).
thf(refl_axiom,axiom,
! [X1: $i] : ( irel @ X1 @ X1 ),
file('/export/starexec/sandbox/tmp/tmp.EeVcLy4bRr/E---3.1_566420.p',refl_axiom) ).
thf(c_0_11,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[iimplies]) ).
thf(c_0_15,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_16,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X2: $i] :
( ( irel @ Z1 @ X2 )
=> ( Z0 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_17,plain,
( iatom
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[iatom]) ).
thf(c_0_18,plain,
( iimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ! [X24: $i] :
( ( irel @ Z2 @ X24 )
=> ( Z0 @ X24 ) )
| ! [X25: $i] :
( ( irel @ Z2 @ X25 )
=> ( Z1 @ X25 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_19,plain,
( ivalid
= ( ^ [Z0: $i > $o] :
! [X13: $i] : ( Z0 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[ivalid]) ).
thf(c_0_20,plain,
! [X42: $i] :
( ~ ! [X40: $i] :
( ( irel @ X42 @ X40 )
=> ( p1 @ X40 ) )
| ! [X41: $i] :
( ( irel @ X42 @ X41 )
=> ( ~ ! [X38: $i] :
( ( irel @ X41 @ X38 )
=> ( p1 @ X38 ) )
| ! [X39: $i] :
( ( irel @ X41 @ X39 )
=> ( p0 @ X39 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom2,c_0_17]),c_0_18]),c_0_19]) ).
thf(c_0_21,plain,
! [X37: $i] : ( p1 @ X37 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom1,c_0_17]),c_0_19]) ).
thf(c_0_22,plain,
! [X49: $i,X51: $i,X53: $i] :
( ( ( irel @ X51 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ( irel @ X49 @ ( esk1_1 @ X49 ) ) )
& ( ~ ( p1 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ( irel @ X49 @ ( esk1_1 @ X49 ) ) )
& ( ( irel @ X51 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ~ ( p1 @ ( esk1_1 @ X49 ) ) )
& ( ~ ( p1 @ ( esk2_2 @ X49 @ X51 ) )
| ~ ( irel @ X51 @ X53 )
| ( p0 @ X53 )
| ~ ( irel @ X49 @ X51 )
| ~ ( p1 @ ( esk1_1 @ X49 ) ) ) ),
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_20])])])])])]) ).
thf(c_0_23,plain,
! [X48: $i] : ( p1 @ X48 ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
~ ( ivalid @ ( iatom @ p0 ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_25,plain,
! [X3: $i,X2: $i,X1: $i] :
( ( p0 @ X3 )
| ~ ( p1 @ ( esk2_2 @ X1 @ X2 ) )
| ~ ( irel @ X2 @ X3 )
| ~ ( irel @ X1 @ X2 )
| ~ ( p1 @ ( esk1_1 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_26,plain,
! [X1: $i] : ( p1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
! [X44: $i] : ( irel @ X44 @ X44 ),
inference(variable_rename,[status(thm)],[refl_axiom]) ).
thf(c_0_28,negated_conjecture,
~ ! [X43: $i] : ( p0 @ X43 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24,c_0_17]),c_0_19]) ).
thf(c_0_29,plain,
! [X1: $i,X3: $i,X2: $i] :
( ( p0 @ X1 )
| ~ ( irel @ X2 @ X1 )
| ~ ( irel @ X3 @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26])]) ).
thf(c_0_30,plain,
! [X1: $i] : ( irel @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
~ ( p0 @ esk3_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
thf(c_0_32,plain,
! [X2: $i,X1: $i] :
( ( p0 @ X1 )
| ~ ( irel @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_33,negated_conjecture,
~ ( p0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_34,plain,
! [X1: $i] : ( p0 @ X1 ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO068^4.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n016.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:34:04 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/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.EeVcLy4bRr/E---3.1_566420.p
% 0.21/0.27 % Version: 3.5.1-ho
% 0.21/0.27 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27 % Starting post_as_ho11 with 300s (1) cores
% 0.21/0.27 % Starting full_lambda_8 with 300s (1) cores
% 0.21/0.27 % post_as_ho3 with pid 566434 completed with status 0
% 0.21/0.27 % Result found by post_as_ho3
% 0.21/0.27 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HGUNS-FFSF21-SHSSMFNN
% 0.21/0.27 % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % SubtermCWHack with pid 566439 completed with status 0
% 0.21/0.27 % Result found by SubtermCWHack
% 0.21/0.27 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HGUNS-FFSF21-SHSSMFNN
% 0.21/0.27 % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % Preprocessing time : 0.001 s
% 0.21/0.27
% 0.21/0.27 % Proof found!
% 0.21/0.27 % SZS status Theorem
% 0.21/0.27 % SZS output start CNFRefutation
% See solution above
% 0.21/0.27 % Parsed axioms : 46
% 0.21/0.27 % Removed by relevancy pruning/SinE : 0
% 0.21/0.27 % Initial clauses : 30
% 0.21/0.27 % Removed in clause preprocessing : 22
% 0.21/0.27 % Initial clauses in saturation : 8
% 0.21/0.27 % Processed clauses : 7
% 0.21/0.27 % ...of these trivial : 0
% 0.21/0.27 % ...subsumed : 0
% 0.21/0.27 % ...remaining for further processing : 7
% 0.21/0.27 % Other redundant clauses eliminated : 0
% 0.21/0.27 % Clauses deleted for lack of memory : 0
% 0.21/0.27 % Backward-subsumed : 1
% 0.21/0.27 % Backward-rewritten : 2
% 0.21/0.27 % Generated clauses : 3
% 0.21/0.27 % ...of the previous two non-redundant : 2
% 0.21/0.27 % ...aggressively subsumed : 0
% 0.21/0.27 % Contextual simplify-reflections : 0
% 0.21/0.27 % Paramodulations : 3
% 0.21/0.27 % Factorizations : 0
% 0.21/0.27 % NegExts : 0
% 0.21/0.27 % Equation resolutions : 0
% 0.21/0.27 % Disequality decompositions : 0
% 0.21/0.27 % Total rewrite steps : 4
% 0.21/0.27 % ...of those cached : 0
% 0.21/0.27 % Propositional unsat checks : 0
% 0.21/0.27 % Propositional check models : 0
% 0.21/0.27 % Propositional check unsatisfiable : 0
% 0.21/0.27 % Propositional clauses : 0
% 0.21/0.27 % Propositional clauses after purity: 0
% 0.21/0.27 % Propositional unsat core size : 0
% 0.21/0.27 % Propositional preprocessing time : 0.000
% 0.21/0.27 % Propositional encoding time : 0.000
% 0.21/0.27 % Propositional solver time : 0.000
% 0.21/0.27 % Success case prop preproc time : 0.000
% 0.21/0.27 % Success case prop encoding time : 0.000
% 0.21/0.27 % Success case prop solver time : 0.000
% 0.21/0.27 % Current number of processed clauses : 4
% 0.21/0.27 % Positive orientable unit clauses : 3
% 0.21/0.27 % Positive unorientable unit clauses: 0
% 0.21/0.27 % Negative unit clauses : 0
% 0.21/0.27 % Non-unit-clauses : 1
% 0.21/0.27 % Current number of unprocessed clauses: 3
% 0.21/0.27 % ...number of literals in the above : 15
% 0.21/0.27 % Current number of archived formulas : 0
% 0.21/0.27 % Current number of archived clauses : 3
% 0.21/0.27 % Clause-clause subsumption calls (NU) : 1
% 0.21/0.27 % Rec. Clause-clause subsumption calls : 1
% 0.21/0.27 % Non-unit clause-clause subsumptions : 1
% 0.21/0.27 % Unit Clause-clause subsumption calls : 0
% 0.21/0.27 % Rewrite failures with RHS unbound : 0
% 0.21/0.27 % BW rewrite match attempts : 2
% 0.21/0.27 % BW rewrite match successes : 2
% 0.21/0.27 % Condensation attempts : 0
% 0.21/0.27 % Condensation successes : 0
% 0.21/0.27 % Termbank termtop insertions : 1930
% 0.21/0.27 % Search garbage collected termcells : 533
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.005 s
% 0.21/0.27 % System time : 0.002 s
% 0.21/0.27 % Total time : 0.007 s
% 0.21/0.27 % Maximum resident set size: 3664 pages
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.007 s
% 0.21/0.27 % System time : 0.006 s
% 0.21/0.27 % Total time : 0.013 s
% 0.21/0.27 % Maximum resident set size: 4864 pages
% 0.21/0.27 % E exiting
%------------------------------------------------------------------------------