%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET011^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:21:51 AM UTC 2026
% Result : Theorem 0.24s 0.28s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 2 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 108 ( 25 ~; 20 |; 14 &; 48 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 4 ^; 7 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > $o ).
thf(decl_24,type,
epred2_0: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(cBOOL_PROP_82_pme,conjecture,
! [X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
& ~ ( ( X1 @ X3 )
& ~ ( X2 @ X3 ) ) ) )
= ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Ag3QusU6Vj/E---3.1_1246657.p',cBOOL_PROP_82_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
& ~ ( ( X1 @ X3 )
& ~ ( X2 @ X3 ) ) ) )
= ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X2 @ X3 ) ) ) ),
inference(assume_negation,[status(cth)],[cBOOL_PROP_82_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o,X6: a] :
( ( ( X1 @ X6 )
& ~ ( ( X1 @ X6 )
& ~ ( X2 @ X6 ) ) )
<=> ( ( X1 @ X6 )
& ( X2 @ X6 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
( ( ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
( ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
epred1_0 @ esk1_0,
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
epred2_0 @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET011^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n001.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:41:12 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/0.26 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.Ag3QusU6Vj/E---3.1_1246657.p
% 0.24/0.28 % Version: 3.5.1-ho
% 0.24/0.28 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.24/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.24/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.24/0.28 % Starting new_bool_9 with 300s (1) cores
% 0.24/0.28 % Starting sh5l with 300s (1) cores
% 0.24/0.28 % post_as_ho10 with pid 1246671 completed with status 0
% 0.24/0.28 % Result found by post_as_ho10
% 0.24/0.28 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.24/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.24/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.24/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.28 % No SInE strategy applied
% 0.24/0.28 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.24/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.28 % SubtermCWHack with pid 1246678 completed with status 0
% 0.24/0.28 % Result found by SubtermCWHack
% 0.24/0.28 % Preprocessing class: HSSSSMSSSSSNSSN.
% 0.24/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.28 % Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.24/0.28 % Starting post_as_ho10 with 300s (1) cores
% 0.24/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.28 % No SInE strategy applied
% 0.24/0.28 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.24/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.28 % Preprocessing time : 0.001 s
% 0.24/0.28
% 0.24/0.28 % Proof found!
% 0.24/0.28 % SZS status Theorem
% 0.24/0.28 % SZS output start CNFRefutation
% See solution above
% 0.24/0.28 % Parsed axioms : 2
% 0.24/0.28 % Removed by relevancy pruning/SinE : 0
% 0.24/0.28 % Initial clauses : 7
% 0.24/0.28 % Removed in clause preprocessing : 3
% 0.24/0.28 % Initial clauses in saturation : 4
% 0.24/0.28 % Processed clauses : 4
% 0.24/0.28 % ...of these trivial : 1
% 0.24/0.28 % ...subsumed : 0
% 0.24/0.28 % ...remaining for further processing : 2
% 0.24/0.28 % Other redundant clauses eliminated : 0
% 0.24/0.28 % Clauses deleted for lack of memory : 0
% 0.24/0.28 % Backward-subsumed : 0
% 0.24/0.28 % Backward-rewritten : 0
% 0.24/0.28 % Generated clauses : 0
% 0.24/0.28 % ...of the previous two non-redundant : 0
% 0.24/0.28 % ...aggressively subsumed : 0
% 0.24/0.28 % Contextual simplify-reflections : 0
% 0.24/0.28 % Paramodulations : 0
% 0.24/0.28 % Factorizations : 0
% 0.24/0.28 % NegExts : 0
% 0.24/0.28 % Equation resolutions : 0
% 0.24/0.28 % Disequality decompositions : 0
% 0.24/0.28 % Total rewrite steps : 4
% 0.24/0.28 % ...of those cached : 2
% 0.24/0.28 % Propositional unsat checks : 0
% 0.24/0.28 % Propositional check models : 0
% 0.24/0.28 % Propositional check unsatisfiable : 0
% 0.24/0.28 % Propositional clauses : 0
% 0.24/0.28 % Propositional clauses after purity: 0
% 0.24/0.28 % Propositional unsat core size : 0
% 0.24/0.28 % Propositional preprocessing time : 0.000
% 0.24/0.28 % Propositional encoding time : 0.000
% 0.24/0.28 % Propositional solver time : 0.000
% 0.24/0.28 % Success case prop preproc time : 0.000
% 0.24/0.28 % Success case prop encoding time : 0.000
% 0.24/0.28 % Success case prop solver time : 0.000
% 0.24/0.28 % Current number of processed clauses : 2
% 0.24/0.28 % Positive orientable unit clauses : 2
% 0.24/0.28 % Positive unorientable unit clauses: 0
% 0.24/0.28 % Negative unit clauses : 0
% 0.24/0.28 % Non-unit-clauses : 0
% 0.24/0.28 % Current number of unprocessed clauses: 0
% 0.24/0.28 % ...number of literals in the above : 0
% 0.24/0.28 % Current number of archived formulas : 0
% 0.24/0.28 % Current number of archived clauses : 0
% 0.24/0.28 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.28 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.28 % Non-unit clause-clause subsumptions : 0
% 0.24/0.28 % Unit Clause-clause subsumption calls : 0
% 0.24/0.28 % Rewrite failures with RHS unbound : 0
% 0.24/0.28 % BW rewrite match attempts : 0
% 0.24/0.28 % BW rewrite match successes : 0
% 0.24/0.28 % Condensation attempts : 0
% 0.24/0.28 % Condensation successes : 0
% 0.24/0.28 % Termbank termtop insertions : 493
% 0.24/0.28 % Search garbage collected termcells : 146
% 0.24/0.28
% 0.24/0.28 % -------------------------------------------------
% 0.24/0.28 % User time : 0.005 s
% 0.24/0.28 % System time : 0.000 s
% 0.24/0.28 % Total time : 0.005 s
% 0.24/0.28 % Maximum resident set size: 3628 pages
% 0.24/0.28
% 0.24/0.28 % -------------------------------------------------
% 0.24/0.28 % User time : 0.006 s
% 0.24/0.28 % System time : 0.005 s
% 0.24/0.28 % Total time : 0.011 s
% 0.24/0.28 % Maximum resident set size: 4864 pages
% 0.24/0.28 % E exiting
%------------------------------------------------------------------------------