TSTP Solution File: NLP267^18 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP267^18 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:50 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 24
% Syntax : Number of formulae : 44 ( 16 unt; 16 typ; 0 def)
% Number of atoms : 68 ( 8 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 157 ( 13 ~; 10 |; 6 &; 120 @)
% ( 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 : 39 ( 20 ^ 19 !; 0 ?; 39 :)
% 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/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(mbox_def,axiom,
( mbox
= ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
! [X6: mworld] :
( ( mrel @ X5 @ X3 @ X6 )
=> ( X1 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_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(axiom_5,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
thf(axiom_2,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
thf('mrel_#b_s_universal',axiom,
! [X3: mworld,X6: mworld] : ( mrel @ '#b_s' @ X3 @ X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_#b_s_universal') ).
thf(con,conjecture,
mlocal @ ( mbox @ '#b_s' @ ( 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,
( 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,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_12,plain,
! [X17: mworld] :
( ( mrel @ '#b_s' @ mactual @ X17 )
=> ( ( dest @ paris @ X17 )
& ( class @ second @ X17 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axiom_5,c_0_8]),c_0_9]),c_0_10]) ).
thf(c_0_13,plain,
! [X12: mworld] :
( ( mrel @ '#b_s' @ 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)],[axiom_2,c_0_8]),c_0_9]),c_0_11]),c_0_10]) ).
thf(c_0_14,plain,
! [X29: mworld] :
( ( ( dest @ paris @ X29 )
| ~ ( mrel @ '#b_s' @ mactual @ X29 ) )
& ( ( class @ second @ X29 )
| ~ ( mrel @ '#b_s' @ mactual @ X29 ) ) ),
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,plain,
! [X21: mworld,X22: mworld] : ( mrel @ '#b_s' @ X21 @ X22 ),
inference(variable_rename,[status(thm)],['mrel_#b_s_universal']) ).
thf(c_0_16,negated_conjecture,
~ ! [X18: mworld] :
( ( mrel @ '#b_s' @ mactual @ X18 )
=> ( price @ seventy @ X18 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]),c_0_8]),c_0_10]) ).
thf(c_0_17,plain,
! [X24: mworld] :
( ~ ( mrel @ '#b_s' @ mactual @ X24 )
| ~ ( dest @ paris @ X24 )
| ~ ( class @ second @ X24 )
| ( price @ seventy @ X24 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
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,plain,
! [X3: mworld,X6: mworld] : ( mrel @ '#b_s' @ X3 @ X6 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,plain,
! [X3: mworld] :
( ( class @ second @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_21,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_16])])])]) ).
thf(c_0_22,plain,
! [X3: mworld] :
( ( price @ seventy @ X3 )
| ~ ( mrel @ '#b_s' @ mactual @ X3 )
| ~ ( dest @ paris @ X3 )
| ~ ( class @ second @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_23,plain,
! [X3: mworld] : ( dest @ paris @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
thf(c_0_24,plain,
! [X3: mworld] : ( class @ second @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
thf(c_0_25,negated_conjecture,
~ ( price @ seventy @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_26,plain,
! [X3: mworld] : ( price @ seventy @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_19])]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP267^18 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 21:29:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/0.47 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.48 # Version: 3.1.0-ho
% 0.21/0.48 # partial match(1): HSMSSMSSMLSNHSN
% 0.21/0.48 # Preprocessing class: HSMSSMSMMLSNHSN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.48 # Starting post_as_ho11 with 300s (1) cores
% 0.21/0.48 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.48 # post_as_ho3 with pid 11363 completed with status 0
% 0.21/0.48 # Result found by post_as_ho3
% 0.21/0.48 # partial match(1): HSMSSMSSMLSNHSN
% 0.21/0.48 # Preprocessing class: HSMSSMSMMLSNHSN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.48 # No SInE strategy applied
% 0.21/0.48 # Search class: HHHNS-FFSF00-SHSSMFNN
% 0.21/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.48 # new_ho_10 with pid 11366 completed with status 0
% 0.21/0.48 # Result found by new_ho_10
% 0.21/0.48 # partial match(1): HSMSSMSSMLSNHSN
% 0.21/0.48 # Preprocessing class: HSMSSMSMMLSNHSN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.48 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.48 # No SInE strategy applied
% 0.21/0.48 # Search class: HHHNS-FFSF00-SHSSMFNN
% 0.21/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 40
% 0.21/0.48 # Removed by relevancy pruning/SinE : 0
% 0.21/0.48 # Initial clauses : 34
% 0.21/0.48 # Removed in clause preprocessing : 22
% 0.21/0.48 # Initial clauses in saturation : 12
% 0.21/0.48 # Processed clauses : 10
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 1
% 0.21/0.48 # ...remaining for further processing : 9
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 0
% 0.21/0.48 # Backward-rewritten : 3
% 0.21/0.48 # Generated clauses : 0
% 0.21/0.48 # ...of the previous two non-redundant : 1
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 0
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 11
% 0.21/0.48 # ...of those cached : 5
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 6
% 0.21/0.48 # Positive orientable unit clauses : 5
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 1
% 0.21/0.48 # Non-unit-clauses : 0
% 0.21/0.48 # Current number of unprocessed clauses: 2
% 0.21/0.48 # ...number of literals in the above : 7
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 3
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.21/0.48 # Non-unit clause-clause subsumptions : 1
% 0.21/0.48 # Unit Clause-clause subsumption calls : 0
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 3
% 0.21/0.48 # BW rewrite match successes : 3
% 0.21/0.48 # Condensation attempts : 10
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 1911
% 0.21/0.48 # Search garbage collected termcells : 469
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.004 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.006 s
% 0.21/0.48 # Maximum resident set size: 1736 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.006 s
% 0.21/0.48 # System time : 0.003 s
% 0.21/0.48 # Total time : 0.009 s
% 0.21/0.48 # Maximum resident set size: 1752 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.48 % E exiting
%------------------------------------------------------------------------------