%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP267^3 : 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 : n013.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:02 AM UTC 2026
% Result : Theorem 0.28s 0.40s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 70 ( 8 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 140 ( 15 ~; 11 |; 4 &; 101 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 31 ( 18 ^; 13 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_23,type,
mrel: mworld > mworld > $o ).
thf(decl_24,type,
mactual: mworld ).
thf(decl_25,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_27,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_29,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_31,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_33,type,
seventy: $i ).
thf(decl_35,type,
second: $i ).
thf(decl_36,type,
paris: $i ).
thf(decl_38,type,
price: $i > mworld > $o ).
thf(decl_39,type,
dest: $i > mworld > $o ).
thf(decl_40,type,
class: $i > mworld > $o ).
thf(decl_42,type,
esk2_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OR7iRYDXGW/E---3.1_2002112.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.OR7iRYDXGW/E---3.1_2002112.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.OR7iRYDXGW/E---3.1_2002112.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OR7iRYDXGW/E---3.1_2002112.p',mbox_def) ).
thf(con,conjecture,
mlocal @ ( mbox @ ( price @ seventy ) ),
file('/export/starexec/sandbox2/tmp/tmp.OR7iRYDXGW/E---3.1_2002112.p',con) ).
thf(law2,axiom,
mlocal @ ( mbox @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OR7iRYDXGW/E---3.1_2002112.p',law2) ).
thf(belief2,axiom,
mlocal @ ( mbox @ ( class @ second ) ),
file('/export/starexec/sandbox2/tmp/tmp.OR7iRYDXGW/E---3.1_2002112.p',belief2) ).
thf(belief1,axiom,
mlocal @ ( mbox @ ( dest @ paris ) ),
file('/export/starexec/sandbox2/tmp/tmp.OR7iRYDXGW/E---3.1_2002112.p',belief1) ).
thf(c_0_8,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_9,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_10,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_11,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_12,negated_conjecture,
~ ( mlocal @ ( mbox @ ( price @ seventy ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_13,plain,
! [X9: mworld] :
( ( mrel @ mactual @ X9 )
=> ( ( ( dest @ paris @ X9 )
& ( class @ second @ X9 ) )
=> ( price @ seventy @ X9 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[law2,c_0_8]),c_0_9]),c_0_10]),c_0_11]) ).
thf(c_0_14,plain,
! [X13: mworld] :
( ( mrel @ mactual @ X13 )
=> ( class @ second @ X13 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[belief2,c_0_8]),c_0_11]) ).
thf(c_0_15,plain,
! [X12: mworld] :
( ( mrel @ mactual @ X12 )
=> ( dest @ paris @ X12 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[belief1,c_0_8]),c_0_11]) ).
thf(c_0_16,negated_conjecture,
~ ! [X14: mworld] :
( ( mrel @ mactual @ X14 )
=> ( price @ seventy @ X14 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_8]),c_0_11]) ).
thf(c_0_17,plain,
! [X18: mworld] :
( ~ ( mrel @ mactual @ X18 )
| ~ ( dest @ paris @ X18 )
| ~ ( class @ second @ X18 )
| ( price @ seventy @ X18 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
thf(c_0_18,plain,
! [X22: mworld] :
( ~ ( mrel @ mactual @ X22 )
| ( class @ second @ X22 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
thf(c_0_19,plain,
! [X21: mworld] :
( ~ ( mrel @ mactual @ X21 )
| ( dest @ paris @ X21 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
thf(c_0_20,negated_conjecture,
( ( mrel @ mactual @ esk2_0 )
& ~ ( price @ seventy @ esk2_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
thf(c_0_21,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( dest @ paris @ X3 )
| ~ ( class @ second @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,plain,
! [X3: mworld] :
( ( class @ second @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
! [X3: mworld] :
( ( dest @ paris @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,negated_conjecture,
~ ( price @ seventy @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_25,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
thf(c_0_26,negated_conjecture,
mrel @ mactual @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NLP267^3 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.27 % Computer : n013.cluster.edu
% 0.13/0.27 % Model : x86_64 x86_64
% 0.13/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.27 % Memory : 8046.5625MB
% 0.13/0.27 % OS : Linux 6.8.0-71-generic
% 0.13/0.27 % CPULimit : 300
% 0.13/0.27 % WCLimit : 300
% 0.13/0.27 % DateTime : Tue Sep 29 11:49:36 UTC 2026
% 0.13/0.28 % CPUTime :
% 0.13/0.28 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.35 Running higher-order theorem proving
% 0.28/0.37 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.OR7iRYDXGW/E---3.1_2002112.p
% 0.28/0.40 % Version: 3.5.1-ho
% 0.28/0.40 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.28/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.40 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.28/0.40 % Starting post_as_ho3 with 300s (1) cores
% 0.28/0.40 % Starting post_as_ho11 with 300s (1) cores
% 0.28/0.40 % Starting full_lambda_8 with 300s (1) cores
% 0.28/0.40 % post_as_ho3 with pid 2002126 completed with status 0
% 0.28/0.40 % Result found by post_as_ho3
% 0.28/0.40 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.28/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.40 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.28/0.40 % Starting post_as_ho3 with 300s (1) cores
% 0.28/0.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.40 % No SInE strategy applied
% 0.28/0.40 % Search class: HHHNF-FFSF11-SHSSMFNN
% 0.28/0.40 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.40 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.40 % SubtermCWHack with pid 2002130 completed with status 0
% 0.28/0.40 % Result found by SubtermCWHack
% 0.28/0.40 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.28/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.40 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.28/0.40 % Starting post_as_ho3 with 300s (1) cores
% 0.28/0.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.40 % No SInE strategy applied
% 0.28/0.40 % Search class: HHHNF-FFSF11-SHSSMFNN
% 0.28/0.40 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.40 % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.40 % Preprocessing time : 0.002 s
% 0.28/0.40
% 0.28/0.40 % Proof found!
% 0.28/0.40 % SZS status Theorem
% 0.28/0.40 % SZS output start CNFRefutation
% See solution above
% 0.28/0.40 % Parsed axioms : 35
% 0.28/0.40 % Removed by relevancy pruning/SinE : 0
% 0.28/0.40 % Initial clauses : 28
% 0.28/0.40 % Removed in clause preprocessing : 19
% 0.28/0.40 % Initial clauses in saturation : 9
% 0.28/0.40 % Processed clauses : 8
% 0.28/0.40 % ...of these trivial : 0
% 0.28/0.40 % ...subsumed : 0
% 0.28/0.40 % ...remaining for further processing : 8
% 0.28/0.40 % Other redundant clauses eliminated : 0
% 0.28/0.40 % Clauses deleted for lack of memory : 0
% 0.28/0.40 % Backward-subsumed : 0
% 0.28/0.40 % Backward-rewritten : 0
% 0.28/0.40 % Generated clauses : 1
% 0.28/0.40 % ...of the previous two non-redundant : 0
% 0.28/0.40 % ...aggressively subsumed : 0
% 0.28/0.40 % Contextual simplify-reflections : 3
% 0.28/0.40 % Paramodulations : 1
% 0.28/0.40 % Factorizations : 0
% 0.28/0.40 % NegExts : 0
% 0.28/0.40 % Equation resolutions : 0
% 0.28/0.40 % Disequality decompositions : 0
% 0.28/0.40 % Total rewrite steps : 1
% 0.28/0.40 % ...of those cached : 0
% 0.28/0.40 % Propositional unsat checks : 0
% 0.28/0.40 % Propositional check models : 0
% 0.28/0.40 % Propositional check unsatisfiable : 0
% 0.28/0.40 % Propositional clauses : 0
% 0.28/0.40 % Propositional clauses after purity: 0
% 0.28/0.40 % Propositional unsat core size : 0
% 0.28/0.40 % Propositional preprocessing time : 0.000
% 0.28/0.40 % Propositional encoding time : 0.000
% 0.28/0.40 % Propositional solver time : 0.000
% 0.28/0.40 % Success case prop preproc time : 0.000
% 0.28/0.40 % Success case prop encoding time : 0.000
% 0.28/0.40 % Success case prop solver time : 0.000
% 0.28/0.40 % Current number of processed clauses : 8
% 0.28/0.40 % Positive orientable unit clauses : 2
% 0.28/0.40 % Positive unorientable unit clauses: 0
% 0.28/0.40 % Negative unit clauses : 1
% 0.28/0.40 % Non-unit-clauses : 5
% 0.28/0.40 % Current number of unprocessed clauses: 1
% 0.28/0.40 % ...number of literals in the above : 4
% 0.28/0.40 % Current number of archived formulas : 0
% 0.28/0.40 % Current number of archived clauses : 0
% 0.28/0.40 % Clause-clause subsumption calls (NU) : 3
% 0.28/0.40 % Rec. Clause-clause subsumption calls : 3
% 0.28/0.40 % Non-unit clause-clause subsumptions : 3
% 0.28/0.40 % Unit Clause-clause subsumption calls : 0
% 0.28/0.40 % Rewrite failures with RHS unbound : 0
% 0.28/0.40 % BW rewrite match attempts : 0
% 0.28/0.40 % BW rewrite match successes : 0
% 0.28/0.40 % Condensation attempts : 0
% 0.28/0.40 % Condensation successes : 0
% 0.28/0.40 % Termbank termtop insertions : 1585
% 0.28/0.40 % Search garbage collected termcells : 362
% 0.28/0.40
% 0.28/0.40 % -------------------------------------------------
% 0.28/0.40 % User time : 0.005 s
% 0.28/0.40 % System time : 0.004 s
% 0.28/0.40 % Total time : 0.009 s
% 0.28/0.40 % Maximum resident set size: 3600 pages
% 0.28/0.40
% 0.28/0.40 % -------------------------------------------------
% 0.28/0.40 % User time : 0.008 s
% 0.28/0.40 % System time : 0.010 s
% 0.28/0.40 % Total time : 0.018 s
% 0.28/0.40 % Maximum resident set size: 4864 pages
% 0.28/0.40 % E exiting
%------------------------------------------------------------------------------