TSTP Solution File: LCL961^11 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL961^11 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : Mon May 20 23:55:00 EDT 2024
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of formulae : 37 ( 15 unt; 13 typ; 0 def)
% Number of atoms : 74 ( 8 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 148 ( 14 ~; 12 |; 8 &; 101 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 40 ( 18 ^ 22 !; 0 ?; 40 :)
% 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_27,type,
mor: ( 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,
p: mworld > $o ).
thf(decl_33,type,
q: mworld > $o ).
thf(decl_34,type,
esk1_0: mworld ).
thf(decl_35,type,
esk2_0: mworld ).
thf(decl_36,type,
esk3_0: mworld ).
thf(decl_37,type,
esk4_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).
thf(mor_def,axiom,
( mor
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
| ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor_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(pel16,conjecture,
mlocal @ ( mor @ ( mbox @ ( mimplies @ ( mbox @ p ) @ ( mbox @ q ) ) ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ p ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel16) ).
thf(mrel_euclidean,axiom,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( ( mrel @ X3 @ X6 )
& ( mrel @ X3 @ X5 ) )
=> ( mrel @ X6 @ X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_euclidean) ).
thf(c_0_6,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_7,plain,
( mor
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor_def]) ).
thf(c_0_8,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_9,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_10,negated_conjecture,
~ ( ! [X13: mworld] :
( ( mrel @ mactual @ X13 )
=> ( ! [X11: mworld] :
( ( mrel @ X13 @ X11 )
=> ( p @ X11 ) )
=> ! [X12: mworld] :
( ( mrel @ X13 @ X12 )
=> ( q @ X12 ) ) ) )
| ! [X16: mworld] :
( ( mrel @ mactual @ X16 )
=> ( ! [X14: mworld] :
( ( mrel @ X16 @ X14 )
=> ( q @ X14 ) )
=> ! [X15: mworld] :
( ( mrel @ X16 @ X15 )
=> ( p @ X15 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[pel16]),c_0_6]),c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_11,plain,
! [X18: mworld,X19: mworld,X20: mworld] :
( ~ ( mrel @ X18 @ X20 )
| ~ ( mrel @ X18 @ X19 )
| ( mrel @ X20 @ X19 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mrel_euclidean])])]) ).
thf(c_0_12,negated_conjecture,
! [X22: mworld,X25: mworld] :
( ( mrel @ mactual @ esk1_0 )
& ( ~ ( mrel @ esk1_0 @ X22 )
| ( p @ X22 ) )
& ( mrel @ esk1_0 @ esk2_0 )
& ~ ( q @ esk2_0 )
& ( mrel @ mactual @ esk3_0 )
& ( ~ ( mrel @ esk3_0 @ X25 )
| ( q @ X25 ) )
& ( mrel @ esk3_0 @ esk4_0 )
& ~ ( p @ esk4_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
thf(c_0_13,plain,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( mrel @ X5 @ X6 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( mrel @ X3 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
mrel @ mactual @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
mrel @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X3: mworld] :
( ( mrel @ X3 @ esk3_0 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
mrel @ mactual @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
~ ( q @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_19,negated_conjecture,
! [X3: mworld] :
( ( q @ X3 )
| ~ ( mrel @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_20,negated_conjecture,
! [X3: mworld] :
( ( mrel @ X3 @ esk2_0 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
thf(c_0_21,negated_conjecture,
mrel @ esk1_0 @ esk3_0,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_22,negated_conjecture,
~ ( mrel @ esk3_0 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_18,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.03/0.10 % Problem : LCL961^11 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n005.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 : Mon May 20 01:58:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running higher-order theorem proving
% 0.17/0.43 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.17/0.44 # Version: 3.1.0-ho
% 0.17/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.44 # Starting sh1l with 300s (1) cores
% 0.17/0.44 # Starting post_as_ho10 with 300s (1) cores
% 0.17/0.44 # post_as_ho1 with pid 17638 completed with status 0
% 0.17/0.44 # Result found by post_as_ho1
% 0.17/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: HHUNF-FFSS00-SHSSMFNN
% 0.17/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.44 # new_ho_10 with pid 17642 completed with status 0
% 0.17/0.44 # Result found by new_ho_10
% 0.17/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: HHUNF-FFSS00-SHSSMFNN
% 0.17/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 24
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 23
% 0.17/0.44 # Removed in clause preprocessing : 13
% 0.17/0.44 # Initial clauses in saturation : 10
% 0.17/0.44 # Processed clauses : 32
% 0.17/0.44 # ...of these trivial : 0
% 0.17/0.44 # ...subsumed : 0
% 0.17/0.44 # ...remaining for further processing : 32
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 0
% 0.17/0.44 # Generated clauses : 35
% 0.17/0.44 # ...of the previous two non-redundant : 21
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 35
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Disequality decompositions : 0
% 0.17/0.44 # Total rewrite steps : 13
% 0.17/0.44 # ...of those cached : 4
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 22
% 0.17/0.44 # Positive orientable unit clauses : 10
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 4
% 0.17/0.44 # Non-unit-clauses : 8
% 0.17/0.44 # Current number of unprocessed clauses: 7
% 0.17/0.44 # ...number of literals in the above : 11
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 10
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 7
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 7
% 0.17/0.44 # Non-unit clause-clause subsumptions : 0
% 0.17/0.44 # Unit Clause-clause subsumption calls : 0
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 12
% 0.17/0.44 # BW rewrite match successes : 0
% 0.17/0.44 # Condensation attempts : 32
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 1426
% 0.17/0.44 # Search garbage collected termcells : 339
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.003 s
% 0.17/0.44 # System time : 0.002 s
% 0.17/0.44 # Total time : 0.005 s
% 0.17/0.44 # Maximum resident set size: 1724 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.003 s
% 0.17/0.44 # System time : 0.005 s
% 0.17/0.44 # Total time : 0.008 s
% 0.17/0.44 # Maximum resident set size: 1736 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.44 % E exiting
%------------------------------------------------------------------------------