%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO175^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 : n002.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:43:56 AM UTC 2026
% Result : Theorem 0.23s 0.27s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 87 ( 0 equ; 0 cnn)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 266 ( 27 ~; 14 |; 47 &; 172 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 44 ( 0 ^; 29 !; 15 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
p: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_23,type,
cGRAIN: p ).
thf(decl_24,type,
cVEG_EATS: a > p > $o ).
thf(decl_25,type,
cMEAT_EATS: a > a > $o ).
thf(decl_26,type,
cSNAIL: a ).
thf(decl_27,type,
cCATERPILLAR: a ).
thf(decl_28,type,
cBIRD: a ).
thf(decl_29,type,
cWOLF: a ).
thf(decl_30,type,
cFOX: a ).
thf(decl_31,type,
cSMALLER: a > a > $o ).
thf(decl_32,type,
esk1_0: p ).
thf(decl_33,type,
esk2_0: p ).
thf(cPUZ031_1_HO,conjecture,
( ( ! [X1: a] :
( ! [X2: p] : ( cVEG_EATS @ X1 @ X2 )
| ! [X3: a] :
( ( ( cSMALLER @ X3 @ X1 )
& ? [X4: p] : ( cVEG_EATS @ X3 @ X4 ) )
=> ( cMEAT_EATS @ X1 @ X3 ) ) )
& ( cSMALLER @ cCATERPILLAR @ cBIRD )
& ( cSMALLER @ cSNAIL @ cBIRD )
& ( cSMALLER @ cBIRD @ cFOX )
& ( cSMALLER @ cFOX @ cWOLF )
& ~ ( cMEAT_EATS @ cWOLF @ cFOX )
& ~ ( cVEG_EATS @ cWOLF @ cGRAIN )
& ( cMEAT_EATS @ cBIRD @ cCATERPILLAR )
& ~ ( cMEAT_EATS @ cBIRD @ cSNAIL )
& ? [X2: p] : ( cVEG_EATS @ cCATERPILLAR @ X2 )
& ? [X2: p] : ( cVEG_EATS @ cSNAIL @ X2 ) )
=> ? [X1: a,X5: a] :
( ( cMEAT_EATS @ X1 @ X5 )
& ( cVEG_EATS @ X5 @ cGRAIN ) ) ),
file('/export/starexec/sandbox/tmp/tmp.63tWBWa9Yj/E---3.1_1518209.p',cPUZ031_1_HO) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: a] :
( ! [X2: p] : ( cVEG_EATS @ X1 @ X2 )
| ! [X3: a] :
( ( ( cSMALLER @ X3 @ X1 )
& ? [X4: p] : ( cVEG_EATS @ X3 @ X4 ) )
=> ( cMEAT_EATS @ X1 @ X3 ) ) )
& ( cSMALLER @ cCATERPILLAR @ cBIRD )
& ( cSMALLER @ cSNAIL @ cBIRD )
& ( cSMALLER @ cBIRD @ cFOX )
& ( cSMALLER @ cFOX @ cWOLF )
& ~ ( cMEAT_EATS @ cWOLF @ cFOX )
& ~ ( cVEG_EATS @ cWOLF @ cGRAIN )
& ( cMEAT_EATS @ cBIRD @ cCATERPILLAR )
& ~ ( cMEAT_EATS @ cBIRD @ cSNAIL )
& ? [X2: p] : ( cVEG_EATS @ cCATERPILLAR @ X2 )
& ? [X2: p] : ( cVEG_EATS @ cSNAIL @ X2 ) )
=> ? [X1: a,X5: a] :
( ( cMEAT_EATS @ X1 @ X5 )
& ( cVEG_EATS @ X5 @ cGRAIN ) ) ),
inference(assume_negation,[status(cth)],[cPUZ031_1_HO]) ).
thf(c_0_2,negated_conjecture,
~ ( ( ! [X1: a] :
( ! [X2: p] : ( cVEG_EATS @ X1 @ X2 )
| ! [X3: a] :
( ( ( cSMALLER @ X3 @ X1 )
& ? [X4: p] : ( cVEG_EATS @ X3 @ X4 ) )
=> ( cMEAT_EATS @ X1 @ X3 ) ) )
& ( cSMALLER @ cCATERPILLAR @ cBIRD )
& ( cSMALLER @ cSNAIL @ cBIRD )
& ( cSMALLER @ cBIRD @ cFOX )
& ( cSMALLER @ cFOX @ cWOLF )
& ~ ( cMEAT_EATS @ cWOLF @ cFOX )
& ~ ( cVEG_EATS @ cWOLF @ cGRAIN )
& ( cMEAT_EATS @ cBIRD @ cCATERPILLAR )
& ~ ( cMEAT_EATS @ cBIRD @ cSNAIL )
& ? [X2: p] : ( cVEG_EATS @ cCATERPILLAR @ X2 )
& ? [X2: p] : ( cVEG_EATS @ cSNAIL @ X2 ) )
=> ? [X1: a,X5: a] :
( ( cMEAT_EATS @ X1 @ X5 )
& ( cVEG_EATS @ X5 @ cGRAIN ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X14: a,X15: p,X16: a,X17: p,X20: a,X21: a] :
( ( ( cVEG_EATS @ X14 @ X15 )
| ~ ( cSMALLER @ X16 @ X14 )
| ~ ( cVEG_EATS @ X16 @ X17 )
| ( cMEAT_EATS @ X14 @ X16 ) )
& ( cSMALLER @ cCATERPILLAR @ cBIRD )
& ( cSMALLER @ cSNAIL @ cBIRD )
& ( cSMALLER @ cBIRD @ cFOX )
& ( cSMALLER @ cFOX @ cWOLF )
& ~ ( cMEAT_EATS @ cWOLF @ cFOX )
& ~ ( cVEG_EATS @ cWOLF @ cGRAIN )
& ( cMEAT_EATS @ cBIRD @ cCATERPILLAR )
& ~ ( cMEAT_EATS @ cBIRD @ cSNAIL )
& ( cVEG_EATS @ cCATERPILLAR @ esk1_0 )
& ( cVEG_EATS @ cSNAIL @ esk2_0 )
& ( ~ ( cMEAT_EATS @ X20 @ X21 )
| ~ ( cVEG_EATS @ X21 @ cGRAIN ) ) ),
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: a,X2: p,X3: a,X4: p] :
( ( cVEG_EATS @ X1 @ X2 )
| ( cMEAT_EATS @ X1 @ X3 )
| ~ ( cSMALLER @ X3 @ X1 )
| ~ ( cVEG_EATS @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
cSMALLER @ cSNAIL @ cBIRD,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
~ ( cMEAT_EATS @ cBIRD @ cSNAIL ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
! [X2: p,X4: p] :
( ( cVEG_EATS @ cBIRD @ X2 )
| ~ ( cVEG_EATS @ cSNAIL @ X4 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
cVEG_EATS @ cSNAIL @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
cSMALLER @ cBIRD @ cFOX,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
! [X2: p] : ( cVEG_EATS @ cBIRD @ X2 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
cSMALLER @ cFOX @ cWOLF,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
~ ( cMEAT_EATS @ cWOLF @ cFOX ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
! [X1: a,X3: a] :
( ~ ( cMEAT_EATS @ X1 @ X3 )
| ~ ( cVEG_EATS @ X3 @ cGRAIN ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
! [X2: p] :
( ( cMEAT_EATS @ cFOX @ cBIRD )
| ( cVEG_EATS @ cFOX @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_10])]) ).
thf(c_0_15,negated_conjecture,
! [X2: p,X4: p] :
( ( cVEG_EATS @ cWOLF @ X2 )
| ~ ( cVEG_EATS @ cFOX @ X4 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X2: p] : ( cVEG_EATS @ cFOX @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10])]) ).
thf(c_0_17,negated_conjecture,
~ ( cVEG_EATS @ cWOLF @ cGRAIN ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_18,negated_conjecture,
! [X2: p] : ( cVEG_EATS @ cWOLF @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO175^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.09/0.19 % Computer : n002.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 16:39:52 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/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.63tWBWa9Yj/E---3.1_1518209.p
% 0.23/0.27 % Version: 3.5.1-ho
% 0.23/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.27 % Starting full_lambda_5 with 300s (1) cores
% 0.23/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.23/0.27 % new_bool_1 with pid 1518223 completed with status 0
% 0.23/0.27 % Result found by new_bool_1
% 0.23/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.27 % Search class: HGHNF-FFSM00-SFFFFFNN
% 0.23/0.27 % partial match(1): HGHNF-FFSF00-SFFFFFNN
% 0.23/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.27 % SubtermCWHack with pid 1518227 completed with status 0
% 0.23/0.27 % Result found by SubtermCWHack
% 0.23/0.27 % Preprocessing class: HSMSSMSSSSSNFFN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.27 % Search class: HGHNF-FFSM00-SFFFFFNN
% 0.23/0.27 % partial match(1): HGHNF-FFSF00-SFFFFFNN
% 0.23/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.27 % Preprocessing time : 0.001 s
% 0.23/0.27
% 0.23/0.27 % Proof found!
% 0.23/0.27 % SZS status Theorem
% 0.23/0.27 % SZS output start CNFRefutation
% See solution above
% 0.23/0.27 % Parsed axioms : 12
% 0.23/0.27 % Removed by relevancy pruning/SinE : 11
% 0.23/0.27 % Initial clauses : 12
% 0.23/0.27 % Removed in clause preprocessing : 0
% 0.23/0.27 % Initial clauses in saturation : 12
% 0.23/0.27 % Processed clauses : 19
% 0.23/0.27 % ...of these trivial : 0
% 0.23/0.27 % ...subsumed : 0
% 0.23/0.27 % ...remaining for further processing : 19
% 0.23/0.27 % Other redundant clauses eliminated : 0
% 0.23/0.27 % Clauses deleted for lack of memory : 0
% 0.23/0.27 % Backward-subsumed : 1
% 0.23/0.27 % Backward-rewritten : 3
% 0.23/0.27 % Generated clauses : 8
% 0.23/0.27 % ...of the previous two non-redundant : 8
% 0.23/0.27 % ...aggressively subsumed : 0
% 0.23/0.27 % Contextual simplify-reflections : 0
% 0.23/0.27 % Paramodulations : 8
% 0.23/0.27 % Factorizations : 0
% 0.23/0.27 % NegExts : 0
% 0.23/0.27 % Equation resolutions : 0
% 0.23/0.27 % Disequality decompositions : 0
% 0.23/0.27 % Total rewrite steps : 6
% 0.23/0.27 % ...of those cached : 0
% 0.23/0.27 % Propositional unsat checks : 0
% 0.23/0.27 % Propositional check models : 0
% 0.23/0.27 % Propositional check unsatisfiable : 0
% 0.23/0.27 % Propositional clauses : 0
% 0.23/0.27 % Propositional clauses after purity: 0
% 0.23/0.27 % Propositional unsat core size : 0
% 0.23/0.27 % Propositional preprocessing time : 0.000
% 0.23/0.27 % Propositional encoding time : 0.000
% 0.23/0.27 % Propositional solver time : 0.000
% 0.23/0.27 % Success case prop preproc time : 0.000
% 0.23/0.27 % Success case prop encoding time : 0.000
% 0.23/0.27 % Success case prop solver time : 0.000
% 0.23/0.27 % Current number of processed clauses : 15
% 0.23/0.27 % Positive orientable unit clauses : 10
% 0.23/0.27 % Positive unorientable unit clauses: 0
% 0.23/0.27 % Negative unit clauses : 3
% 0.23/0.27 % Non-unit-clauses : 2
% 0.23/0.27 % Current number of unprocessed clauses: 1
% 0.23/0.27 % ...number of literals in the above : 2
% 0.23/0.27 % Current number of archived formulas : 0
% 0.23/0.27 % Current number of archived clauses : 4
% 0.23/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.23/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.23/0.27 % Non-unit clause-clause subsumptions : 0
% 0.23/0.27 % Unit Clause-clause subsumption calls : 3
% 0.23/0.27 % Rewrite failures with RHS unbound : 0
% 0.23/0.27 % BW rewrite match attempts : 4
% 0.23/0.27 % BW rewrite match successes : 4
% 0.23/0.27 % Condensation attempts : 0
% 0.23/0.27 % Condensation successes : 0
% 0.23/0.27 % Termbank termtop insertions : 977
% 0.23/0.27 % Search garbage collected termcells : 267
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.003 s
% 0.23/0.27 % System time : 0.004 s
% 0.23/0.27 % Total time : 0.006 s
% 0.23/0.27 % Maximum resident set size: 3640 pages
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.004 s
% 0.23/0.27 % System time : 0.009 s
% 0.23/0.27 % Total time : 0.012 s
% 0.23/0.27 % Maximum resident set size: 4864 pages
% 0.23/0.27 % E exiting
%------------------------------------------------------------------------------