TSTP Solution File: NLP267^17 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP267^17 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:49 EDT 2024
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 23
% Syntax : Number of formulae : 40 ( 11 unt; 16 typ; 0 def)
% Number of atoms : 65 ( 8 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 152 ( 14 ~; 11 |; 6 &; 113 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 37 ( 37 >; 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_22,type,
mrel: mindex > mworld > mworld > $o ).
thf(decl_24,type,
'#b_s': mindex ).
thf(decl_25,type,
mactual: mworld ).
thf(decl_26,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_28,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(decl_34,type,
seventy: $i ).
thf(decl_36,type,
second: $i ).
thf(decl_37,type,
paris: $i ).
thf(decl_39,type,
price: $i > mworld > $o ).
thf(decl_40,type,
dest: $i > mworld > $o ).
thf(decl_41,type,
class: $i > mworld > $o ).
thf(decl_42,type,
esk1_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(axiom_2,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
thf(axiom_5,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
thf(con,conjecture,
mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
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,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_12,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_13,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_11])])]) ).
thf(c_0_14,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_12])])])]) ).
thf(c_0_15,negated_conjecture,
~ ! [X23: mworld] :
( ( mrel @ '#b_s' @ mactual @ X23 )
=> ( price @ seventy @ X23 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_7]),c_0_10]) ).
thf(c_0_16,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 )
| ~ ( dest @ paris @ X3 )
| ~ ( class @ second @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X3: mworld] :
( ( class @ second @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,plain,
! [X3: mworld] :
( ( dest @ paris @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,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_15])])])]) ).
thf(c_0_20,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_21,negated_conjecture,
mrel @ '#b_s' @ mactual @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
~ ( price @ seventy @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NLP267^17 : TPTP v8.2.0. Released v8.1.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 22:19:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running higher-order theorem proving
% 0.16/0.44 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/benchmark/theBenchmark.p
% 0.16/0.45 # Version: 3.1.0-ho
% 0.16/0.45 # partial match(1): HSMSSMSSMLSNHSN
% 0.16/0.45 # Preprocessing class: HSMSSMSMMLSNHSN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.16/0.45 # Starting post_as_ho3 with 300s (1) cores
% 0.16/0.45 # Starting post_as_ho11 with 300s (1) cores
% 0.16/0.45 # Starting full_lambda_8 with 300s (1) cores
% 0.16/0.45 # post_as_ho11 with pid 28365 completed with status 0
% 0.16/0.45 # Result found by post_as_ho11
% 0.16/0.45 # partial match(1): HSMSSMSSMLSNHSN
% 0.16/0.45 # Preprocessing class: HSMSSMSMMLSNHSN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.16/0.45 # Starting post_as_ho3 with 300s (1) cores
% 0.16/0.45 # Starting post_as_ho11 with 300s (1) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: HHHNS-FFSF00-SHSSMFNN
% 0.16/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.45 # new_ho_10 with pid 28367 completed with status 0
% 0.16/0.45 # Result found by new_ho_10
% 0.16/0.45 # partial match(1): HSMSSMSSMLSNHSN
% 0.16/0.45 # Preprocessing class: HSMSSMSMMLSNHSN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.16/0.45 # Starting post_as_ho3 with 300s (1) cores
% 0.16/0.45 # Starting post_as_ho11 with 300s (1) cores
% 0.16/0.45 # No SInE strategy applied
% 0.16/0.45 # Search class: HHHNS-FFSF00-SHSSMFNN
% 0.16/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 42
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 36
% 0.16/0.45 # Removed in clause preprocessing : 22
% 0.16/0.45 # Initial clauses in saturation : 14
% 0.16/0.45 # Processed clauses : 17
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 1
% 0.16/0.45 # ...remaining for further processing : 16
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 1
% 0.16/0.45 # ...of the previous two non-redundant : 0
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 3
% 0.16/0.45 # Paramodulations : 1
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 0
% 0.16/0.45 # ...of those cached : 0
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 3
% 0.16/0.45 # Positive orientable unit clauses : 1
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 1
% 0.16/0.45 # Non-unit-clauses : 1
% 0.16/0.45 # Current number of unprocessed clauses: 10
% 0.16/0.45 # ...number of literals in the above : 23
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 13
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 10
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 9
% 0.16/0.45 # Non-unit clause-clause subsumptions : 4
% 0.16/0.45 # Unit Clause-clause subsumption calls : 0
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 2
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 17
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 2238
% 0.16/0.45 # Search garbage collected termcells : 531
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.005 s
% 0.16/0.45 # System time : 0.001 s
% 0.16/0.45 # Total time : 0.006 s
% 0.16/0.45 # Maximum resident set size: 1872 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.005 s
% 0.16/0.45 # System time : 0.004 s
% 0.16/0.45 # Total time : 0.009 s
% 0.16/0.45 # Maximum resident set size: 1760 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------