%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ149^13 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:20:38 AM UTC 2026
% Result : Theorem 0.27s 0.39s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 121 ( 12 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 283 ( 39 ~; 27 |; 12 &; 196 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 59 ( 30 ^; 23 !; 6 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mindex: $tType ).
thf(decl_sort2,type,
mworld: $tType ).
thf(decl_23,type,
mrel: mindex > mworld > mworld > $o ).
thf(decl_24,type,
'#pour_b': mindex ).
thf(decl_25,type,
'#make_c': mindex ).
thf(decl_26,type,
'#pour_a': mindex ).
thf(decl_27,type,
mactual: mworld ).
thf(decl_28,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_29,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_34,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(decl_35,type,
mdia: mindex > ( mworld > $o ) > mworld > $o ).
thf(decl_36,type,
acid: mworld > $o ).
thf(decl_39,type,
esk3_0: mworld ).
thf(decl_40,type,
esk4_0: mworld ).
thf(decl_45,type,
esk9_0: mworld ).
thf(conj,conjecture,
mlocal @ ( mand @ ( mdia @ '#pour_a' @ ( mnot @ acid ) ) @ ( mdia @ '#pour_a' @ ( mdia @ '#pour_b' @ acid ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',conj) ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',mlocal_def) ).
thf(mnot_def,axiom,
( mnot
= ( ^ [X2: mworld > $o,X3: mworld] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',mnot_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',mand_def) ).
thf(mdia_def,axiom,
( mdia
= ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
? [X6: mworld] :
( ( mrel @ X5 @ X3 @ X6 )
& ( X1 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',mdia_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
! [X6: mworld] :
( ( mrel @ X5 @ X3 @ X6 )
=> ( X1 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',mbox_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',mimplies_def) ).
thf(pour_a_acid,axiom,
mlocal @ ( mbox @ '#pour_a' @ ( mnot @ acid ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',pour_a_acid) ).
thf(pour_ab_make_axiom_2,axiom,
mlocal @ ( mimplies @ ( mbox @ '#pour_a' @ ( mbox @ '#pour_b' @ ( mnot @ acid ) ) ) @ ( mbox @ '#make_c' @ ( mnot @ acid ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',pour_ab_make_axiom_2) ).
thf(make_c_acid,axiom,
mlocal @ ( mdia @ '#make_c' @ acid ),
file('/export/starexec/sandbox/tmp/tmp.nueQmGomy1/E---3.1_3145960.p',make_c_acid) ).
thf(c_0_10,negated_conjecture,
~ ( mlocal @ ( mand @ ( mdia @ '#pour_a' @ ( mnot @ acid ) ) @ ( mdia @ '#pour_a' @ ( mdia @ '#pour_b' @ acid ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_11,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: mworld > $o,Z1: mworld] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot_def]) ).
thf(c_0_13,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_14,plain,
( mdia
= ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
? [X6: mworld] :
( ( mrel @ Z0 @ Z2 @ X6 )
& ( Z1 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_def]) ).
thf(c_0_15,plain,
( mbox
= ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
! [X6: mworld] :
( ( mrel @ Z0 @ Z2 @ X6 )
=> ( Z1 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_16,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_17,negated_conjecture,
~ ( ? [X21: mworld] :
( ( mrel @ '#pour_a' @ mactual @ X21 )
& ~ ( acid @ X21 ) )
& ? [X23: mworld] :
( ( mrel @ '#pour_a' @ mactual @ X23 )
& ? [X22: mworld] :
( ( mrel @ '#pour_b' @ X23 @ X22 )
& ( acid @ X22 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
thf(c_0_18,plain,
! [X19: mworld] :
( ( mrel @ '#pour_a' @ mactual @ X19 )
=> ~ ( acid @ X19 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pour_a_acid,c_0_11]),c_0_12]),c_0_15])]) ).
thf(c_0_19,plain,
( ! [X11: mworld] :
( ( mrel @ '#pour_a' @ mactual @ X11 )
=> ! [X10: mworld] :
( ( mrel @ '#pour_b' @ X11 @ X10 )
=> ~ ( acid @ X10 ) ) )
=> ! [X12: mworld] :
( ( mrel @ '#make_c' @ mactual @ X12 )
=> ~ ( acid @ X12 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pour_ab_make_axiom_2,c_0_11]),c_0_12]),c_0_16]),c_0_15])]) ).
thf(c_0_20,plain,
? [X20: mworld] :
( ( mrel @ '#make_c' @ mactual @ X20 )
& ( acid @ X20 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[make_c_acid,c_0_11]),c_0_14]) ).
thf(c_0_21,negated_conjecture,
! [X38: mworld,X39: mworld,X40: mworld] :
( ~ ( mrel @ '#pour_a' @ mactual @ X38 )
| ( acid @ X38 )
| ~ ( mrel @ '#pour_a' @ mactual @ X39 )
| ~ ( mrel @ '#pour_b' @ X39 @ X40 )
| ~ ( acid @ X40 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
thf(c_0_22,plain,
! [X36: mworld] :
( ~ ( mrel @ '#pour_a' @ mactual @ X36 )
| ~ ( acid @ X36 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
thf(c_0_23,plain,
! [X29: mworld] :
( ( ( mrel @ '#pour_a' @ mactual @ esk3_0 )
| ~ ( mrel @ '#make_c' @ mactual @ X29 )
| ~ ( acid @ X29 ) )
& ( ( mrel @ '#pour_b' @ esk3_0 @ esk4_0 )
| ~ ( mrel @ '#make_c' @ mactual @ X29 )
| ~ ( acid @ X29 ) )
& ( ( acid @ esk4_0 )
| ~ ( mrel @ '#make_c' @ mactual @ X29 )
| ~ ( acid @ X29 ) ) ),
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_19])])])])])]) ).
thf(c_0_24,plain,
( ( mrel @ '#make_c' @ mactual @ esk9_0 )
& ( acid @ esk9_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_20])]) ).
thf(c_0_25,negated_conjecture,
! [X3: mworld,X6: mworld,X7: mworld] :
( ( acid @ X3 )
| ~ ( mrel @ '#pour_a' @ mactual @ X3 )
| ~ ( mrel @ '#pour_a' @ mactual @ X6 )
| ~ ( mrel @ '#pour_b' @ X6 @ X7 )
| ~ ( acid @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_26,plain,
! [X3: mworld] :
( ~ ( mrel @ '#pour_a' @ mactual @ X3 )
| ~ ( acid @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,plain,
! [X3: mworld] :
( ( mrel @ '#pour_a' @ mactual @ esk3_0 )
| ~ ( mrel @ '#make_c' @ mactual @ X3 )
| ~ ( acid @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_28,plain,
mrel @ '#make_c' @ mactual @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_29,plain,
acid @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,negated_conjecture,
! [X3: mworld,X6: mworld,X7: mworld] :
( ~ ( mrel @ '#pour_a' @ mactual @ X3 )
| ~ ( mrel @ '#pour_a' @ mactual @ X6 )
| ~ ( mrel @ '#pour_b' @ X3 @ X7 )
| ~ ( acid @ X7 ) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_31,plain,
mrel @ '#pour_a' @ mactual @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
thf(c_0_32,plain,
! [X3: mworld] :
( ( mrel @ '#pour_b' @ esk3_0 @ esk4_0 )
| ~ ( mrel @ '#make_c' @ mactual @ X3 )
| ~ ( acid @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_33,plain,
! [X3: mworld] :
( ( acid @ esk4_0 )
| ~ ( mrel @ '#make_c' @ mactual @ X3 )
| ~ ( acid @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_34,negated_conjecture,
! [X3: mworld,X6: mworld] :
( ~ ( mrel @ '#pour_a' @ mactual @ X3 )
| ~ ( mrel @ '#pour_b' @ X3 @ X6 )
| ~ ( acid @ X6 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,plain,
mrel @ '#pour_b' @ esk3_0 @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_29])]) ).
thf(c_0_36,plain,
acid @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_29])]) ).
thf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PUZ149^13 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.27 % Computer : n008.cluster.edu
% 0.11/0.27 % Model : x86_64 x86_64
% 0.11/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.27 % Memory : 8046.5625MB
% 0.11/0.27 % OS : Linux 6.8.0-71-generic
% 0.11/0.27 % CPULimit : 300
% 0.11/0.27 % WCLimit : 300
% 0.11/0.27 % DateTime : Tue Sep 29 13:28:24 UTC 2026
% 0.11/0.27 % CPUTime :
% 0.11/0.27 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.34 Running higher-order theorem proving
% 0.27/0.36 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.nueQmGomy1/E---3.1_3145960.p
% 0.27/0.39 % Version: 3.5.1-ho
% 0.27/0.39 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.27/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.39 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.27/0.39 % Starting post_as_ho3 with 300s (1) cores
% 0.27/0.39 % Starting post_as_ho11 with 300s (1) cores
% 0.27/0.39 % Starting full_lambda_8 with 300s (1) cores
% 0.27/0.39 % full_lambda_8 with pid 3145976 completed with status 0
% 0.27/0.39 % Result found by full_lambda_8
% 0.27/0.39 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.27/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.39 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.27/0.39 % Starting post_as_ho3 with 300s (1) cores
% 0.27/0.39 % Starting post_as_ho11 with 300s (1) cores
% 0.27/0.39 % Starting full_lambda_8 with 300s (1) cores
% 0.27/0.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.39 % No SInE strategy applied
% 0.27/0.39 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.27/0.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.39 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.39 % SubtermCWHack with pid 3145977 completed with status 0
% 0.27/0.39 % Result found by SubtermCWHack
% 0.27/0.39 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.27/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.39 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.27/0.39 % Starting post_as_ho3 with 300s (1) cores
% 0.27/0.39 % Starting post_as_ho11 with 300s (1) cores
% 0.27/0.39 % Starting full_lambda_8 with 300s (1) cores
% 0.27/0.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.39 % No SInE strategy applied
% 0.27/0.39 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.27/0.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.39 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.39 % Preprocessing time : 0.002 s
% 0.27/0.39
% 0.27/0.39 % Proof found!
% 0.27/0.39 % SZS status Theorem
% 0.27/0.39 % SZS output start CNFRefutation
% See solution above
% 0.27/0.39 % Parsed axioms : 31
% 0.27/0.39 % Removed by relevancy pruning/SinE : 0
% 0.27/0.39 % Initial clauses : 32
% 0.27/0.39 % Removed in clause preprocessing : 16
% 0.27/0.39 % Initial clauses in saturation : 16
% 0.27/0.39 % Processed clauses : 24
% 0.27/0.39 % ...of these trivial : 0
% 0.27/0.39 % ...subsumed : 0
% 0.27/0.39 % ...remaining for further processing : 24
% 0.27/0.39 % Other redundant clauses eliminated : 0
% 0.27/0.39 % Clauses deleted for lack of memory : 0
% 0.27/0.39 % Backward-subsumed : 1
% 0.27/0.39 % Backward-rewritten : 6
% 0.27/0.39 % Generated clauses : 16
% 0.27/0.39 % ...of the previous two non-redundant : 8
% 0.27/0.39 % ...aggressively subsumed : 0
% 0.27/0.39 % Contextual simplify-reflections : 1
% 0.27/0.39 % Paramodulations : 16
% 0.27/0.39 % Factorizations : 0
% 0.27/0.39 % NegExts : 0
% 0.27/0.39 % Equation resolutions : 0
% 0.27/0.39 % Disequality decompositions : 0
% 0.27/0.39 % Total rewrite steps : 20
% 0.27/0.39 % ...of those cached : 13
% 0.27/0.39 % Propositional unsat checks : 0
% 0.27/0.39 % Propositional check models : 0
% 0.27/0.39 % Propositional check unsatisfiable : 0
% 0.27/0.39 % Propositional clauses : 0
% 0.27/0.39 % Propositional clauses after purity: 0
% 0.27/0.39 % Propositional unsat core size : 0
% 0.27/0.39 % Propositional preprocessing time : 0.000
% 0.27/0.39 % Propositional encoding time : 0.000
% 0.27/0.39 % Propositional solver time : 0.000
% 0.27/0.39 % Success case prop preproc time : 0.000
% 0.27/0.39 % Success case prop encoding time : 0.000
% 0.27/0.39 % Success case prop solver time : 0.000
% 0.27/0.39 % Current number of processed clauses : 17
% 0.27/0.39 % Positive orientable unit clauses : 8
% 0.27/0.39 % Positive unorientable unit clauses: 0
% 0.27/0.39 % Negative unit clauses : 1
% 0.27/0.39 % Non-unit-clauses : 8
% 0.27/0.39 % Current number of unprocessed clauses: 0
% 0.27/0.39 % ...number of literals in the above : 0
% 0.27/0.40 % Current number of archived formulas : 0
% 0.27/0.40 % Current number of archived clauses : 7
% 0.27/0.40 % Clause-clause subsumption calls (NU) : 14
% 0.27/0.40 % Rec. Clause-clause subsumption calls : 12
% 0.27/0.40 % Non-unit clause-clause subsumptions : 2
% 0.27/0.40 % Unit Clause-clause subsumption calls : 3
% 0.27/0.40 % Rewrite failures with RHS unbound : 0
% 0.27/0.40 % BW rewrite match attempts : 9
% 0.27/0.40 % BW rewrite match successes : 6
% 0.27/0.40 % Condensation attempts : 0
% 0.27/0.40 % Condensation successes : 0
% 0.27/0.40 % Termbank termtop insertions : 2701
% 0.27/0.40 % Search garbage collected termcells : 808
% 0.27/0.40
% 0.27/0.40 % -------------------------------------------------
% 0.27/0.40 % User time : 0.009 s
% 0.27/0.40 % System time : 0.001 s
% 0.27/0.40 % Total time : 0.011 s
% 0.27/0.40 % Maximum resident set size: 3652 pages
% 0.27/0.40
% 0.27/0.40 % -------------------------------------------------
% 0.27/0.40 % User time : 0.012 s
% 0.27/0.40 % System time : 0.008 s
% 0.27/0.40 % Total time : 0.020 s
% 0.27/0.40 % Maximum resident set size: 4608 pages
% 0.27/0.40 % E exiting
%------------------------------------------------------------------------------