%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP267^17 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:16:01 AM UTC 2026
% Result : Theorem 0.24s 0.33s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 68 ( 8 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 157 ( 15 ~; 11 |; 6 &; 117 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 31 ( 20 ^; 11 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mindex: $tType ).
thf(decl_sort2,type,
mworld: $tType ).
thf(decl_23,type,
mrel: mindex > mworld > mworld > $o ).
thf(decl_25,type,
'#b_s': mindex ).
thf(decl_26,type,
mactual: mworld ).
thf(decl_27,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_29,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_31,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_33,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(decl_35,type,
seventy: $i ).
thf(decl_37,type,
second: $i ).
thf(decl_38,type,
paris: $i ).
thf(decl_40,type,
price: $i > mworld > $o ).
thf(decl_41,type,
dest: $i > mworld > $o ).
thf(decl_42,type,
class: $i > mworld > $o ).
thf(decl_43,type,
esk1_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEg569yGnU/E---3.1_4173564.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEg569yGnU/E---3.1_4173564.p',mand_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEg569yGnU/E---3.1_4173564.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
! [X6: mworld] :
( ( mrel @ X5 @ X3 @ X6 )
=> ( X1 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEg569yGnU/E---3.1_4173564.p',mbox_def) ).
thf(con,conjecture,
mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEg569yGnU/E---3.1_4173564.p',con) ).
thf(axiom_2,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEg569yGnU/E---3.1_4173564.p',axiom_2) ).
thf(axiom_5,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iEg569yGnU/E---3.1_4173564.p',axiom_5) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_8,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_10,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_11,negated_conjecture,
~ ( mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_12,plain,
! [X17: mworld] :
( ( mrel @ '#b_s' @ mactual @ X17 )
=> ( ( ( dest @ paris @ X17 )
& ( class @ second @ X17 ) )
=> ( price @ seventy @ X17 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_2,c_0_7]),c_0_8]),c_0_9]),c_0_10]) ).
thf(c_0_13,plain,
! [X22: mworld] :
( ( mrel @ '#b_s' @ mactual @ X22 )
=> ( ( dest @ paris @ X22 )
& ( class @ second @ X22 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_5,c_0_7]),c_0_8]),c_0_10]) ).
thf(c_0_14,negated_conjecture,
~ ! [X23: mworld] :
( ( mrel @ '#b_s' @ mactual @ X23 )
=> ( price @ seventy @ X23 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11,c_0_7]),c_0_10]) ).
thf(c_0_15,plain,
! [X33: mworld] :
( ~ ( mrel @ '#b_s' @ mactual @ X33 )
| ~ ( dest @ paris @ X33 )
| ~ ( class @ second @ X33 )
| ( price @ seventy @ X33 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
thf(c_0_16,plain,
! [X38: mworld] :
( ( ( dest @ paris @ X38 )
| ~ ( mrel @ '#b_s' @ mactual @ X38 ) )
& ( ( class @ second @ X38 )
| ~ ( mrel @ '#b_s' @ mactual @ X38 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
thf(c_0_17,negated_conjecture,
( ( mrel @ '#b_s' @ mactual @ esk1_0 )
& ~ ( price @ seventy @ esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
thf(c_0_18,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 )
| ~ ( dest @ paris @ X3 )
| ~ ( class @ second @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,plain,
! [X3: mworld] :
( ( class @ second @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
! [X3: mworld] :
( ( dest @ paris @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,negated_conjecture,
~ ( price @ seventy @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
thf(c_0_23,negated_conjecture,
mrel @ '#b_s' @ mactual @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NLP267^17 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 % Computer : n011.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 11:48:16 UTC 2026
% 0.11/0.23 % CPUTime :
% 0.11/0.23 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.29 Running higher-order theorem proving
% 0.24/0.31 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.iEg569yGnU/E---3.1_4173564.p
% 0.24/0.33 % Version: 3.5.1-ho
% 0.24/0.33 % partial match(1): HSMSSMSSMLSNHSN
% 0.24/0.33 % Preprocessing class: HSMSSMSMMLSNHSN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.33 % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.33 % Starting post_as_ho11 with 300s (1) cores
% 0.24/0.33 % Starting full_lambda_8 with 300s (1) cores
% 0.24/0.33 % post_as_ho3 with pid 4173579 completed with status 0
% 0.24/0.33 % Result found by post_as_ho3
% 0.24/0.33 % partial match(1): HSMSSMSSMLSNHSN
% 0.24/0.33 % Preprocessing class: HSMSSMSMMLSNHSN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.33 % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.33 % No SInE strategy applied
% 0.24/0.33 % Search class: HHHNS-FFSF00-SHSSMFNN
% 0.24/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.33 % SubtermCWHack with pid 4173586 completed with status 0
% 0.24/0.33 % Result found by SubtermCWHack
% 0.24/0.33 % partial match(1): HSMSSMSSMLSNHSN
% 0.24/0.33 % Preprocessing class: HSMSSMSMMLSNHSN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.33 % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.33 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.33 % No SInE strategy applied
% 0.24/0.33 % Search class: HHHNS-FFSF00-SHSSMFNN
% 0.24/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.33 % Preprocessing time : 0.001 s
% 0.24/0.33
% 0.24/0.33 % Proof found!
% 0.24/0.33 % SZS status Theorem
% 0.24/0.33 % SZS output start CNFRefutation
% See solution above
% 0.24/0.33 % Parsed axioms : 42
% 0.24/0.33 % Removed by relevancy pruning/SinE : 0
% 0.24/0.33 % Initial clauses : 36
% 0.24/0.33 % Removed in clause preprocessing : 22
% 0.24/0.33 % Initial clauses in saturation : 14
% 0.24/0.33 % Processed clauses : 11
% 0.24/0.33 % ...of these trivial : 0
% 0.24/0.33 % ...subsumed : 0
% 0.24/0.33 % ...remaining for further processing : 11
% 0.24/0.33 % Other redundant clauses eliminated : 0
% 0.24/0.33 % Clauses deleted for lack of memory : 0
% 0.24/0.33 % Backward-subsumed : 0
% 0.24/0.33 % Backward-rewritten : 0
% 0.24/0.33 % Generated clauses : 1
% 0.24/0.33 % ...of the previous two non-redundant : 0
% 0.24/0.33 % ...aggressively subsumed : 0
% 0.24/0.33 % Contextual simplify-reflections : 3
% 0.24/0.33 % Paramodulations : 1
% 0.24/0.33 % Factorizations : 0
% 0.24/0.33 % NegExts : 0
% 0.24/0.33 % Equation resolutions : 0
% 0.24/0.33 % Disequality decompositions : 0
% 0.24/0.33 % Total rewrite steps : 1
% 0.24/0.33 % ...of those cached : 0
% 0.24/0.33 % Propositional unsat checks : 0
% 0.24/0.33 % Propositional check models : 0
% 0.24/0.33 % Propositional check unsatisfiable : 0
% 0.24/0.33 % Propositional clauses : 0
% 0.24/0.33 % Propositional clauses after purity: 0
% 0.24/0.33 % Propositional unsat core size : 0
% 0.24/0.33 % Propositional preprocessing time : 0.000
% 0.24/0.33 % Propositional encoding time : 0.000
% 0.24/0.33 % Propositional solver time : 0.000
% 0.24/0.33 % Success case prop preproc time : 0.000
% 0.24/0.33 % Success case prop encoding time : 0.000
% 0.24/0.33 % Success case prop solver time : 0.000
% 0.24/0.33 % Current number of processed clauses : 11
% 0.24/0.33 % Positive orientable unit clauses : 3
% 0.24/0.33 % Positive unorientable unit clauses: 0
% 0.24/0.33 % Negative unit clauses : 1
% 0.24/0.33 % Non-unit-clauses : 7
% 0.24/0.33 % Current number of unprocessed clauses: 3
% 0.24/0.33 % ...number of literals in the above : 10
% 0.24/0.33 % Current number of archived formulas : 0
% 0.24/0.33 % Current number of archived clauses : 0
% 0.24/0.33 % Clause-clause subsumption calls (NU) : 7
% 0.24/0.33 % Rec. Clause-clause subsumption calls : 6
% 0.24/0.33 % Non-unit clause-clause subsumptions : 3
% 0.24/0.33 % Unit Clause-clause subsumption calls : 0
% 0.24/0.33 % Rewrite failures with RHS unbound : 0
% 0.24/0.33 % BW rewrite match attempts : 1
% 0.24/0.33 % BW rewrite match successes : 0
% 0.24/0.33 % Condensation attempts : 0
% 0.24/0.33 % Condensation successes : 0
% 0.24/0.33 % Termbank termtop insertions : 2287
% 0.24/0.33 % Search garbage collected termcells : 530
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.008 s
% 0.24/0.33 % System time : 0.001 s
% 0.24/0.33 % Total time : 0.009 s
% 0.24/0.33 % Maximum resident set size: 3664 pages
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.010 s
% 0.24/0.33 % System time : 0.005 s
% 0.24/0.33 % Total time : 0.015 s
% 0.24/0.33 % Maximum resident set size: 4864 pages
% 0.24/0.34 % E exiting
%------------------------------------------------------------------------------