TSTP Solution File: LCL943^24 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL943^24 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:54:44 EDT 2024
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 38 ( 16 unt; 16 typ; 0 def)
% Number of atoms : 109 ( 8 equ; 0 cnn)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 231 ( 25 ~; 33 |; 10 &; 146 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 6 con; 0-3 aty)
% Number of variables : 48 ( 18 ^ 30 !; 0 ?; 48 :)
% 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,
r: mworld > $o ).
thf(decl_35,type,
esk1_0: mworld ).
thf(decl_36,type,
esk2_1: mworld > mworld ).
thf(decl_37,type,
esk3_1: mworld > mworld ).
thf(decl_38,type,
esk4_0: mworld ).
thf(decl_39,type,
esk5_0: mworld ).
thf(decl_40,type,
esk6_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(pel5,conjecture,
mlocal @ ( mbox @ ( mimplies @ ( mbox @ ( mimplies @ ( mor @ ( mbox @ p ) @ ( mbox @ q ) ) @ ( mor @ ( mbox @ p ) @ ( mbox @ r ) ) ) ) @ ( mor @ ( mbox @ p ) @ ( mbox @ ( mimplies @ ( mbox @ q ) @ ( mbox @ r ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel5) ).
thf(mrel_universal,axiom,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
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,
~ ! [X17: mworld] :
( ( mrel @ mactual @ X17 )
=> ( ! [X12: mworld] :
( ( mrel @ X17 @ X12 )
=> ( ( ! [X8: mworld] :
( ( mrel @ X12 @ X8 )
=> ( p @ X8 ) )
| ! [X9: mworld] :
( ( mrel @ X12 @ X9 )
=> ( q @ X9 ) ) )
=> ( ! [X10: mworld] :
( ( mrel @ X12 @ X10 )
=> ( p @ X10 ) )
| ! [X11: mworld] :
( ( mrel @ X12 @ X11 )
=> ( r @ X11 ) ) ) ) )
=> ( ! [X13: mworld] :
( ( mrel @ X17 @ X13 )
=> ( p @ X13 ) )
| ! [X16: mworld] :
( ( mrel @ X17 @ X16 )
=> ( ! [X14: mworld] :
( ( mrel @ X16 @ X14 )
=> ( q @ X14 ) )
=> ! [X15: mworld] :
( ( mrel @ X16 @ X15 )
=> ( r @ 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)],[pel5]),c_0_6]),c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X21: mworld,X24: mworld,X25: mworld,X28: mworld] :
( ( mrel @ mactual @ esk1_0 )
& ( ( mrel @ X21 @ ( esk2_1 @ X21 ) )
| ~ ( mrel @ X21 @ X24 )
| ( p @ X24 )
| ~ ( mrel @ X21 @ X25 )
| ( r @ X25 )
| ~ ( mrel @ esk1_0 @ X21 ) )
& ( ~ ( p @ ( esk2_1 @ X21 ) )
| ~ ( mrel @ X21 @ X24 )
| ( p @ X24 )
| ~ ( mrel @ X21 @ X25 )
| ( r @ X25 )
| ~ ( mrel @ esk1_0 @ X21 ) )
& ( ( mrel @ X21 @ ( esk3_1 @ X21 ) )
| ~ ( mrel @ X21 @ X24 )
| ( p @ X24 )
| ~ ( mrel @ X21 @ X25 )
| ( r @ X25 )
| ~ ( mrel @ esk1_0 @ X21 ) )
& ( ~ ( q @ ( esk3_1 @ X21 ) )
| ~ ( mrel @ X21 @ X24 )
| ( p @ X24 )
| ~ ( mrel @ X21 @ X25 )
| ( r @ X25 )
| ~ ( mrel @ esk1_0 @ X21 ) )
& ( mrel @ esk1_0 @ esk4_0 )
& ~ ( p @ esk4_0 )
& ( mrel @ esk1_0 @ esk5_0 )
& ( ~ ( mrel @ esk5_0 @ X28 )
| ( q @ X28 ) )
& ( mrel @ esk5_0 @ esk6_0 )
& ~ ( r @ esk6_0 ) ),
inference(distribute,[status(thm)],[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_12,plain,
! [X18: mworld,X19: mworld] : ( mrel @ X18 @ X19 ),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
thf(c_0_13,negated_conjecture,
! [X3: mworld] :
( ( q @ X3 )
| ~ ( mrel @ esk5_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X6: mworld,X5: mworld,X3: mworld] :
( ( p @ X5 )
| ( r @ X6 )
| ~ ( q @ ( esk3_1 @ X3 ) )
| ~ ( mrel @ X3 @ X5 )
| ~ ( mrel @ X3 @ X6 )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
! [X3: mworld] : ( q @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_17,negated_conjecture,
~ ( r @ esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
! [X3: mworld,X5: mworld] :
( ( r @ X3 )
| ( p @ X5 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14]),c_0_14]),c_0_16]),c_0_14])]) ).
thf(c_0_19,negated_conjecture,
~ ( p @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_20,negated_conjecture,
! [X3: mworld] : ( p @ X3 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL943^24 : TPTP v8.2.0. Released v8.1.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n022.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon May 20 01:50:22 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running higher-order theorem proving
% 0.18/0.45 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.18/0.46 # Version: 3.1.0-ho
% 0.18/0.46 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_9 with 1500s (5) cores
% 0.18/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.46 # Starting sh1l with 300s (1) cores
% 0.18/0.46 # Starting post_as_ho10 with 300s (1) cores
% 0.18/0.46 # post_as_ho1 with pid 5521 completed with status 0
% 0.18/0.46 # Result found by post_as_ho1
% 0.18/0.46 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_9 with 1500s (5) cores
% 0.18/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: HGUNF-FFSS11-SHSSMFNN
% 0.18/0.46 # partial match(1): HGUNF-FFSF11-SHSSMFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting sh7 with 181s (1) cores
% 0.18/0.46 # sh7 with pid 5524 completed with status 0
% 0.18/0.46 # Result found by sh7
% 0.18/0.46 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting new_ho_9 with 1500s (5) cores
% 0.18/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: HGUNF-FFSS11-SHSSMFNN
% 0.18/0.46 # partial match(1): HGUNF-FFSF11-SHSSMFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting sh7 with 181s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 24
% 0.18/0.46 # Removed by relevancy pruning/SinE : 0
% 0.18/0.46 # Initial clauses : 26
% 0.18/0.46 # Removed in clause preprocessing : 14
% 0.18/0.46 # Initial clauses in saturation : 12
% 0.18/0.46 # Processed clauses : 18
% 0.18/0.46 # ...of these trivial : 2
% 0.18/0.46 # ...subsumed : 0
% 0.18/0.46 # ...remaining for further processing : 16
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 2
% 0.18/0.46 # Backward-rewritten : 5
% 0.18/0.46 # Generated clauses : 1
% 0.18/0.46 # ...of the previous two non-redundant : 1
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 1
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Disequality decompositions : 0
% 0.18/0.46 # Total rewrite steps : 21
% 0.18/0.46 # ...of those cached : 8
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 4
% 0.18/0.46 # Positive orientable unit clauses : 3
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 1
% 0.18/0.46 # Non-unit-clauses : 0
% 0.18/0.46 # Current number of unprocessed clauses: 0
% 0.18/0.46 # ...number of literals in the above : 0
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 12
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 1
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 1
% 0.18/0.46 # Non-unit clause-clause subsumptions : 1
% 0.18/0.46 # Unit Clause-clause subsumption calls : 1
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 6
% 0.18/0.46 # BW rewrite match successes : 6
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 1604
% 0.18/0.46 # Search garbage collected termcells : 568
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.004 s
% 0.18/0.46 # System time : 0.001 s
% 0.18/0.46 # Total time : 0.005 s
% 0.18/0.46 # Maximum resident set size: 1872 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.007 s
% 0.18/0.46 # System time : 0.002 s
% 0.18/0.46 # Total time : 0.009 s
% 0.18/0.46 # Maximum resident set size: 1732 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------