%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO112^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 : n009.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:24 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 76 ( 0 equ; 0 cnn)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 163 ( 29 ~; 46 |; 7 &; 75 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 8 con; 0-1 aty)
% Number of variables : 35 ( 0 ^; 31 !; 4 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
cP: $i > $o ).
thf(decl_24,type,
esk1_0: $i ).
thf(decl_25,type,
esk2_0: $i ).
thf(decl_26,type,
esk3_0: $i ).
thf(decl_27,type,
esk4_0: $i ).
thf(decl_28,type,
esk5_0: $i ).
thf(decl_29,type,
esk6_0: $i ).
thf(decl_30,type,
esk7_0: $i ).
thf(cTHM53,conjecture,
( ! [X1: $i] :
( ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) )
<=> ( ! [X1: $i] : ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.t0g2MlAlSy/E---3.1_23989.p',cTHM53) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: $i] :
( ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) )
<=> ( ! [X1: $i] : ( cP @ X1 )
<=> ? [X2: $i] : ( cP @ X2 ) ) ),
inference(assume_negation,[status(cth)],[cTHM53]) ).
thf(c_0_2,negated_conjecture,
! [X8: $i,X11: $i,X12: $i,X14: $i,X16: $i,X17: $i,X20: $i,X21: $i] :
( ( ~ ( cP @ esk3_0 )
| ~ ( cP @ X11 )
| ~ ( cP @ esk1_0 )
| ~ ( cP @ X8 ) )
& ( ( cP @ X12 )
| ( cP @ esk4_0 )
| ~ ( cP @ esk1_0 )
| ~ ( cP @ X8 ) )
& ( ~ ( cP @ esk3_0 )
| ~ ( cP @ X11 )
| ( cP @ esk1_0 )
| ( cP @ esk2_0 ) )
& ( ( cP @ X12 )
| ( cP @ esk4_0 )
| ( cP @ esk1_0 )
| ( cP @ esk2_0 ) )
& ( ~ ( cP @ esk6_0 )
| ( cP @ esk7_0 )
| ~ ( cP @ X14 )
| ( cP @ esk5_0 ) )
& ( ~ ( cP @ X20 )
| ( cP @ X21 )
| ~ ( cP @ X14 )
| ( cP @ esk5_0 ) )
& ( ~ ( cP @ esk6_0 )
| ( cP @ esk7_0 )
| ~ ( cP @ X16 )
| ( cP @ X17 ) )
& ( ~ ( cP @ X20 )
| ( cP @ X21 )
| ~ ( cP @ X16 )
| ( cP @ X17 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i] :
( ( cP @ X1 )
| ( cP @ esk4_0 )
| ( cP @ esk1_0 )
| ( cP @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( cP @ X2 )
| ( cP @ X4 )
| ~ ( cP @ X1 )
| ~ ( cP @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( cP @ esk4_0 )
| ( cP @ esk1_0 )
| ( cP @ esk2_0 ) ),
inference(ef,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i] :
( ( cP @ esk2_0 )
| ( cP @ esk1_0 )
| ~ ( cP @ X1 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_4]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( cP @ esk1_0 )
| ( cP @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP @ esk1_0 )
| ( cP @ X1 )
| ~ ( cP @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( cP @ esk1_0 )
| ( cP @ X1 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_10,negated_conjecture,
cP @ esk1_0,
inference(ef,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( cP @ X1 )
| ( cP @ X2 )
| ~ ( cP @ X3 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( cP @ esk3_0 )
| ~ ( cP @ X1 )
| ~ ( cP @ esk1_0 )
| ~ ( cP @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ( cP @ X1 )
| ( cP @ X2 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( cP @ esk3_0 )
| ~ ( cP @ X1 )
| ~ ( cP @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10])]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] : ( cP @ X1 ),
inference(ef,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO112^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n009.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 16:34:15 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.10/0.24 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.t0g2MlAlSy/E---3.1_23989.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.25 % Starting sh4l with 300s (1) cores
% 0.10/0.25 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.10/0.25 % ho_unfolding_6 with pid 24021 completed with status 0
% 0.10/0.25 % Result found by ho_unfolding_6
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGHNF-FFSF00-SFFFFFNN
% 0.10/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.25 % SubtermCWHack with pid 24026 completed with status 0
% 0.10/0.25 % Result found by SubtermCWHack
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGHNF-FFSF00-SFFFFFNN
% 0.10/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.25 % Preprocessing time : 0.001 s
% 0.10/0.25
% 0.10/0.25 % Proof found!
% 0.10/0.25 % SZS status Theorem
% 0.10/0.25 % SZS output start CNFRefutation
% See solution above
% 0.10/0.25 % Parsed axioms : 2
% 0.10/0.25 % Removed by relevancy pruning/SinE : 0
% 0.10/0.25 % Initial clauses : 9
% 0.10/0.25 % Removed in clause preprocessing : 1
% 0.10/0.25 % Initial clauses in saturation : 8
% 0.10/0.25 % Processed clauses : 18
% 0.10/0.25 % ...of these trivial : 0
% 0.10/0.25 % ...subsumed : 0
% 0.10/0.25 % ...remaining for further processing : 18
% 0.10/0.25 % Other redundant clauses eliminated : 0
% 0.10/0.25 % Clauses deleted for lack of memory : 0
% 0.10/0.25 % Backward-subsumed : 14
% 0.10/0.25 % Backward-rewritten : 3
% 0.10/0.25 % Generated clauses : 19
% 0.10/0.25 % ...of the previous two non-redundant : 18
% 0.10/0.25 % ...aggressively subsumed : 0
% 0.10/0.25 % Contextual simplify-reflections : 3
% 0.10/0.25 % Paramodulations : 13
% 0.10/0.25 % Factorizations : 6
% 0.10/0.25 % NegExts : 0
% 0.10/0.25 % Equation resolutions : 0
% 0.10/0.25 % Disequality decompositions : 0
% 0.10/0.25 % Total rewrite steps : 5
% 0.10/0.25 % ...of those cached : 0
% 0.10/0.25 % Propositional unsat checks : 0
% 0.10/0.25 % Propositional check models : 0
% 0.10/0.25 % Propositional check unsatisfiable : 0
% 0.10/0.25 % Propositional clauses : 0
% 0.10/0.25 % Propositional clauses after purity: 0
% 0.10/0.25 % Propositional unsat core size : 0
% 0.10/0.25 % Propositional preprocessing time : 0.000
% 0.10/0.25 % Propositional encoding time : 0.000
% 0.10/0.25 % Propositional solver time : 0.000
% 0.10/0.25 % Success case prop preproc time : 0.000
% 0.10/0.25 % Success case prop encoding time : 0.000
% 0.10/0.25 % Success case prop solver time : 0.000
% 0.10/0.25 % Current number of processed clauses : 1
% 0.10/0.25 % Positive orientable unit clauses : 1
% 0.10/0.25 % Positive unorientable unit clauses: 0
% 0.10/0.25 % Negative unit clauses : 0
% 0.10/0.25 % Non-unit-clauses : 0
% 0.10/0.25 % Current number of unprocessed clauses: 5
% 0.10/0.25 % ...number of literals in the above : 15
% 0.10/0.25 % Current number of archived formulas : 0
% 0.10/0.25 % Current number of archived clauses : 17
% 0.10/0.25 % Clause-clause subsumption calls (NU) : 15
% 0.10/0.25 % Rec. Clause-clause subsumption calls : 15
% 0.10/0.25 % Non-unit clause-clause subsumptions : 15
% 0.10/0.25 % Unit Clause-clause subsumption calls : 2
% 0.10/0.25 % Rewrite failures with RHS unbound : 0
% 0.10/0.26 % BW rewrite match attempts : 5
% 0.10/0.26 % BW rewrite match successes : 5
% 0.10/0.26 % Condensation attempts : 0
% 0.10/0.26 % Condensation successes : 0
% 0.10/0.26 % Termbank termtop insertions : 1120
% 0.10/0.26 % Search garbage collected termcells : 255
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.003 s
% 0.10/0.26 % System time : 0.002 s
% 0.10/0.26 % Total time : 0.005 s
% 0.10/0.26 % Maximum resident set size: 3624 pages
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.003 s
% 0.10/0.26 % System time : 0.004 s
% 0.10/0.26 % Total time : 0.008 s
% 0.10/0.26 % Maximum resident set size: 4864 pages
% 0.10/0.26 % E exiting
%------------------------------------------------------------------------------