%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO178^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:42:30 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 45 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 335 ( 0 equ; 0 cnn)
% Maximal formula atoms : 58 ( 7 avg)
% Number of connectives : 454 ( 164 ~; 222 |; 68 &; 0 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 12 con; 0-0 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
cM: $o ).
thf(decl_24,type,
cN: $o ).
thf(decl_25,type,
cG: $o ).
thf(decl_26,type,
cK: $o ).
thf(decl_27,type,
cE: $o ).
thf(decl_28,type,
cR: $o ).
thf(decl_29,type,
cF: $o ).
thf(decl_30,type,
cC: $o ).
thf(decl_31,type,
cB: $o ).
thf(decl_32,type,
cP: $o ).
thf(decl_33,type,
cL: $o ).
thf(cPORKCHOP1C,conjecture,
~ ( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
file('/export/starexec/sandbox2/tmp/tmp.jFQXNXaTtX/E---3.1_1474406.p',cPORKCHOP1C) ).
thf(c_0_1,negated_conjecture,
~ ~ ( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
inference(assume_negation,[status(cth)],[cPORKCHOP1C]) ).
thf(c_0_2,negated_conjecture,
~ ~ ( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
( cL
& cE
& ( ~ cF
| cB )
& ( ~ cL
| ~ cP
| cM )
& ( ~ cG
| cR
| cM )
& ( cG
| cP
| cR )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cL
| ~ cM
| cC )
& ( cG
| cR
| cK )
& ( ~ cR
| ~ cE
| ~ cC )
& ( ~ cR
| cN
| cF
| cP )
& ( ~ cK
| ~ cL
| ~ cE
| ~ cM )
& ( ~ cG
| cK
| cM
| ~ cB )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cG
| ~ cB
| cR
| ~ cC )
& ( cK
| ~ cN
| ~ cM
| cF )
& ( ~ cR
| cK
| cM
| cG )
& ( ~ cE
| cK
| ~ cG
| cN
| ~ cM ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
thf(c_0_4,negated_conjecture,
( ~ cR
| ~ cE
| ~ cC ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
cE,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( cC
| ~ cL
| ~ cM ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
cL,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
( ~ cR
| ~ cC ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]) ).
thf(c_0_9,negated_conjecture,
( cC
| ~ cM ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
thf(c_0_10,negated_conjecture,
( cK
| cM
| cG
| ~ cR ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
( cG
| cR
| cK ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
( ~ cR
| ~ cM ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
( cK
| cG
| cM ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ~ cK
| ~ cL
| ~ cE
| ~ cM ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_15,negated_conjecture,
( cK
| cN
| ~ cE
| ~ cG
| ~ cM ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
( cG
| cK ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13]) ).
thf(c_0_17,negated_conjecture,
( ~ cM
| ~ cK ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_5]),c_0_7])]) ).
thf(c_0_18,negated_conjecture,
( cK
| cF
| ~ cN
| ~ cM ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_19,negated_conjecture,
( cN
| ~ cM ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_5])]),c_0_16]),c_0_17]) ).
thf(c_0_20,negated_conjecture,
( cM
| ~ cL
| ~ cP ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_21,negated_conjecture,
( cR
| ~ cG
| ~ cB
| ~ cC ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_22,negated_conjecture,
( cB
| ~ cF ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_23,negated_conjecture,
( cF
| ~ cM ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
thf(c_0_24,negated_conjecture,
( cM
| ~ cP ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_7])]) ).
thf(c_0_25,negated_conjecture,
( cG
| cP
| cR ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_26,negated_conjecture,
( cR
| cM
| ~ cG ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_27,negated_conjecture,
( ~ cG
| ~ cC
| ~ cB ),
inference(csr,[status(thm)],[c_0_21,c_0_8]) ).
thf(c_0_28,negated_conjecture,
( cB
| ~ cM ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_29,negated_conjecture,
( cG
| ~ cM ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
thf(c_0_30,negated_conjecture,
( cR
| cM ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_31,negated_conjecture,
~ cM,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_9]),c_0_29]) ).
thf(c_0_32,negated_conjecture,
( cN
| cF
| cP
| ~ cR ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_33,negated_conjecture,
cR,
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_34,negated_conjecture,
( cP
| cF
| cC
| ~ cN ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_35,negated_conjecture,
( cN
| cF
| cP ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
thf(c_0_36,negated_conjecture,
~ cC,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_33])]) ).
thf(c_0_37,negated_conjecture,
( cF
| cP ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
thf(c_0_38,negated_conjecture,
( cK
| cM
| ~ cG
| ~ cB ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_39,negated_conjecture,
( cC
| ~ cK
| ~ cB ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_40,negated_conjecture,
( cP
| cB ),
inference(spm,[status(thm)],[c_0_22,c_0_37]) ).
thf(c_0_41,negated_conjecture,
( cK
| cM
| ~ cB ),
inference(csr,[status(thm)],[c_0_38,c_0_16]) ).
thf(c_0_42,negated_conjecture,
( cP
| ~ cK ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]) ).
thf(c_0_43,negated_conjecture,
cP,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_40]),c_0_31]),c_0_42]) ).
thf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_43])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO178^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n001.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 16:43:06 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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.jFQXNXaTtX/E---3.1_1474406.p
% 0.08/0.26 % Version: 3.5.1-ho
% 0.08/0.26 % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting sh5l with 300s (1) cores
% 0.08/0.26 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.26 % Starting new_bool_2 with 300s (1) cores
% 0.08/0.26 % sh5l with pid 1474434 completed with status 0
% 0.08/0.26 % Result found by sh5l
% 0.08/0.26 % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting sh5l with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.26 % Search class: HGHNF-FFSS00-SFFFFFNN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % SubtermCWHack with pid 1474440 completed with status 0
% 0.08/0.26 % Result found by SubtermCWHack
% 0.08/0.26 % Preprocessing class: HSMSSLSSSSSNFFN.
% 0.08/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26 % Starting sh5l with 300s (1) cores
% 0.08/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.26 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.26 % Search class: HGHNF-FFSS00-SFFFFFNN
% 0.08/0.26 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26 % Preprocessing time : 0.001 s
% 0.08/0.26
% 0.08/0.26 % Proof found!
% 0.08/0.26 % SZS status Theorem
% 0.08/0.26 % SZS output start CNFRefutation
% See solution above
% 0.08/0.26 % Parsed axioms : 12
% 0.08/0.26 % Removed by relevancy pruning/SinE : 11
% 0.08/0.26 % Initial clauses : 18
% 0.08/0.26 % Removed in clause preprocessing : 0
% 0.08/0.26 % Initial clauses in saturation : 18
% 0.08/0.26 % Processed clauses : 33
% 0.08/0.26 % ...of these trivial : 0
% 0.08/0.26 % ...subsumed : 1
% 0.08/0.26 % ...remaining for further processing : 32
% 0.08/0.26 % Other redundant clauses eliminated : 0
% 0.08/0.26 % Clauses deleted for lack of memory : 0
% 0.08/0.26 % Backward-subsumed : 15
% 0.08/0.26 % Backward-rewritten : 6
% 0.08/0.26 % Generated clauses : 20
% 0.08/0.26 % ...of the previous two non-redundant : 19
% 0.08/0.26 % ...aggressively subsumed : 0
% 0.08/0.26 % Contextual simplify-reflections : 11
% 0.08/0.26 % Paramodulations : 19
% 0.08/0.26 % Factorizations : 0
% 0.08/0.26 % NegExts : 0
% 0.08/0.26 % Equation resolutions : 0
% 0.08/0.26 % Disequality decompositions : 0
% 0.08/0.26 % Total rewrite steps : 12
% 0.08/0.26 % ...of those cached : 8
% 0.08/0.26 % Propositional unsat checks : 0
% 0.08/0.26 % Propositional check models : 0
% 0.08/0.26 % Propositional check unsatisfiable : 0
% 0.08/0.26 % Propositional clauses : 0
% 0.08/0.26 % Propositional clauses after purity: 0
% 0.08/0.26 % Propositional unsat core size : 0
% 0.08/0.26 % Propositional preprocessing time : 0.000
% 0.08/0.26 % Propositional encoding time : 0.000
% 0.08/0.26 % Propositional solver time : 0.000
% 0.08/0.26 % Success case prop preproc time : 0.000
% 0.08/0.26 % Success case prop encoding time : 0.000
% 0.08/0.26 % Success case prop solver time : 0.000
% 0.08/0.26 % Current number of processed clauses : 10
% 0.08/0.26 % Positive orientable unit clauses : 4
% 0.08/0.26 % Positive unorientable unit clauses: 0
% 0.08/0.26 % Negative unit clauses : 2
% 0.08/0.26 % Non-unit-clauses : 4
% 0.08/0.26 % Current number of unprocessed clauses: 1
% 0.08/0.26 % ...number of literals in the above : 1
% 0.08/0.26 % Current number of archived formulas : 0
% 0.08/0.26 % Current number of archived clauses : 22
% 0.08/0.26 % Clause-clause subsumption calls (NU) : 136
% 0.08/0.26 % Rec. Clause-clause subsumption calls : 119
% 0.08/0.26 % Non-unit clause-clause subsumptions : 18
% 0.08/0.26 % Unit Clause-clause subsumption calls : 15
% 0.08/0.26 % Rewrite failures with RHS unbound : 0
% 0.08/0.26 % BW rewrite match attempts : 2
% 0.08/0.26 % BW rewrite match successes : 2
% 0.08/0.26 % Condensation attempts : 0
% 0.08/0.26 % Condensation successes : 0
% 0.08/0.26 % Termbank termtop insertions : 1731
% 0.08/0.26 % Search garbage collected termcells : 1
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.005 s
% 0.08/0.26 % System time : 0.002 s
% 0.08/0.26 % Total time : 0.006 s
% 0.08/0.26 % Maximum resident set size: 3636 pages
% 0.08/0.26
% 0.08/0.26 % -------------------------------------------------
% 0.08/0.26 % User time : 0.008 s
% 0.08/0.26 % System time : 0.004 s
% 0.08/0.26 % Total time : 0.012 s
% 0.08/0.26 % Maximum resident set size: 4864 pages
% 0.08/0.26 % E exiting
%------------------------------------------------------------------------------