TSTP Solution File: NLP267^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP267^4 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:55:51 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 41 ( 11 unt; 14 typ; 0 def)
% Number of atoms : 67 ( 8 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 136 ( 14 ~; 11 |; 4 &; 98 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 35 ( 35 >; 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_22,type,
mrel: mworld > mworld > $o ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_26,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_28,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
seventy: $i ).
thf(decl_34,type,
second: $i ).
thf(decl_35,type,
paris: $i ).
thf(decl_37,type,
price: $i > mworld > $o ).
thf(decl_38,type,
dest: $i > mworld > $o ).
thf(decl_39,type,
class: $i > mworld > $o ).
thf(decl_40,type,
esk1_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mand_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_def) ).
thf(law2,axiom,
mlocal @ ( mbox @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',law2) ).
thf(belief2,axiom,
mlocal @ ( mbox @ ( class @ second ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief2) ).
thf(belief1,axiom,
mlocal @ ( mbox @ ( dest @ paris ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',belief1) ).
thf(con,conjecture,
mlocal @ ( mbox @ ( price @ seventy ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
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,plain,
! [X12: mworld] :
( ( mrel @ mactual @ X12 )
=> ( ( ( dest @ paris @ X12 )
& ( class @ second @ X12 ) )
=> ( price @ seventy @ X12 ) ) ),
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_13,plain,
! [X16: mworld] :
( ( mrel @ mactual @ X16 )
=> ( class @ second @ X16 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[belief2,c_0_8]),c_0_11]) ).
thf(c_0_14,plain,
! [X15: mworld] :
( ( mrel @ mactual @ X15 )
=> ( dest @ paris @ X15 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[belief1,c_0_8]),c_0_11]) ).
thf(c_0_15,negated_conjecture,
~ ! [X17: mworld] :
( ( mrel @ mactual @ X17 )
=> ( price @ seventy @ X17 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_8]),c_0_11]) ).
thf(c_0_16,plain,
! [X23: mworld] :
( ~ ( mrel @ mactual @ X23 )
| ~ ( dest @ paris @ X23 )
| ~ ( class @ second @ X23 )
| ( price @ seventy @ X23 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
thf(c_0_17,plain,
! [X27: mworld] :
( ~ ( mrel @ mactual @ X27 )
| ( class @ second @ X27 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
thf(c_0_18,plain,
! [X26: mworld] :
( ~ ( mrel @ mactual @ X26 )
| ( dest @ paris @ X26 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
thf(c_0_19,negated_conjecture,
( ( mrel @ 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_15])])])]) ).
thf(c_0_20,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( dest @ paris @ X3 )
| ~ ( class @ second @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,plain,
! [X3: mworld] :
( ( class @ second @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,plain,
! [X3: mworld] :
( ( dest @ paris @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,negated_conjecture,
~ ( price @ seventy @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_25,negated_conjecture,
mrel @ mactual @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NLP267^4 : TPTP v8.2.0. Released v8.1.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 22:01:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.51 # post_as_ho3 with pid 4141 completed with status 0
% 0.21/0.51 # Result found by post_as_ho3
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HHHNF-FFSF00-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 4144 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HHHNF-FFSF00-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 36
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 29
% 0.21/0.51 # Removed in clause preprocessing : 19
% 0.21/0.51 # Initial clauses in saturation : 10
% 0.21/0.51 # Processed clauses : 15
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 1
% 0.21/0.51 # ...remaining for further processing : 14
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 1
% 0.21/0.51 # ...of the previous two non-redundant : 0
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 3
% 0.21/0.51 # Paramodulations : 1
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 1
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 5
% 0.21/0.51 # Positive orientable unit clauses : 2
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 2
% 0.21/0.51 # Current number of unprocessed clauses: 4
% 0.21/0.51 # ...number of literals in the above : 10
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 9
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 5
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 5
% 0.21/0.51 # Non-unit clause-clause subsumptions : 4
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 3
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 15
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 1644
% 0.21/0.51 # Search garbage collected termcells : 390
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.003 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.005 s
% 0.21/0.51 # Maximum resident set size: 1736 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.005 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.009 s
% 0.21/0.51 # Maximum resident set size: 1740 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------