TSTP Solution File: LCL957^6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL957^6 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:59 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 35 ( 16 unt; 15 typ; 0 def)
% Number of atoms : 81 ( 10 equ; 0 cnn)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 196 ( 12 ~; 10 |; 7 &; 151 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 45 ( 45 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 61 ( 24 ^ 33 !; 4 ?; 61 :)
% 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_28,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_33,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
big_r: $i > $i > mworld > $o ).
thf(decl_35,type,
esk1_0: mworld ).
thf(decl_36,type,
esk2_2: mworld > $i > mworld ).
thf(decl_37,type,
esk3_1: $i > mworld ).
thf(decl_38,type,
esk4_1: $i > $i ).
thf(decl_39,type,
esk5_1: $i > mworld ).
thf(decl_40,type,
esk6_1: $i > mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_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(mforall_di_def,axiom,
( mforall_di
= ( ^ [X6: $i > mworld > $o,X3: mworld] :
! [X7: $i] : ( X6 @ X7 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_di_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
? [X7: $i] : ( X8 @ X7 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexists_di_def) ).
thf(x2122,conjecture,
( mlocal
@ ( mbox
@ ( mimplies
@ ( mbox
@ ( mimplies
@ ( mexists_di
@ ^ [X7: $i] : ( mbox @ ( big_r @ X7 @ X7 ) ) )
@ ( mbox
@ ( mforall_di
@ ^ [X9: $i] : ( mbox @ ( big_r @ X9 @ X9 ) ) ) ) ) )
@ ( mexists_di
@ ^ [X10: $i] :
( mbox
@ ( mforall_di
@ ^ [X11: $i] : ( mbox @ ( mimplies @ ( mbox @ ( big_r @ X10 @ X10 ) ) @ ( mbox @ ( big_r @ X11 @ X11 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2122) ).
thf(mrel_universal,axiom,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_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,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X7: $i] : ( Z0 @ X7 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_11,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X7: $i] : ( Z0 @ X7 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_12,negated_conjecture,
~ ! [X26: mworld] :
( ( mrel @ mactual @ X26 )
=> ( ! [X19: mworld] :
( ( mrel @ X26 @ X19 )
=> ( ? [X15: $i] :
! [X14: mworld] :
( ( mrel @ X19 @ X14 )
=> ( big_r @ X15 @ X15 @ X14 ) )
=> ! [X18: mworld] :
( ( mrel @ X19 @ X18 )
=> ! [X17: $i,X16: mworld] :
( ( mrel @ X18 @ X16 )
=> ( big_r @ X17 @ X17 @ X16 ) ) ) ) )
=> ? [X25: $i] :
! [X24: mworld] :
( ( mrel @ X26 @ X24 )
=> ! [X23: $i,X22: mworld] :
( ( mrel @ X24 @ X22 )
=> ( ! [X20: mworld] :
( ( mrel @ X22 @ X20 )
=> ( big_r @ X25 @ X25 @ X20 ) )
=> ! [X21: mworld] :
( ( mrel @ X22 @ X21 )
=> ( big_r @ X23 @ X23 @ X21 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2122])]),c_0_7]),c_0_8]),c_0_9]),c_0_10]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X30: mworld,X31: $i,X33: mworld,X34: $i,X35: mworld,X36: $i,X40: mworld] :
( ( mrel @ mactual @ esk1_0 )
& ( ( mrel @ X30 @ ( esk2_2 @ X30 @ X31 ) )
| ~ ( mrel @ X30 @ X33 )
| ~ ( mrel @ X33 @ X35 )
| ( big_r @ X34 @ X34 @ X35 )
| ~ ( mrel @ esk1_0 @ X30 ) )
& ( ~ ( big_r @ X31 @ X31 @ ( esk2_2 @ X30 @ X31 ) )
| ~ ( mrel @ X30 @ X33 )
| ~ ( mrel @ X33 @ X35 )
| ( big_r @ X34 @ X34 @ X35 )
| ~ ( mrel @ esk1_0 @ X30 ) )
& ( mrel @ esk1_0 @ ( esk3_1 @ X36 ) )
& ( mrel @ ( esk3_1 @ X36 ) @ ( esk5_1 @ X36 ) )
& ( ~ ( mrel @ ( esk5_1 @ X36 ) @ X40 )
| ( big_r @ X36 @ X36 @ X40 ) )
& ( mrel @ ( esk5_1 @ X36 ) @ ( esk6_1 @ X36 ) )
& ~ ( big_r @ ( esk4_1 @ X36 ) @ ( esk4_1 @ X36 ) @ ( esk6_1 @ X36 ) ) ),
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_12])])])])])]) ).
thf(c_0_14,plain,
! [X27: mworld,X28: mworld] : ( mrel @ X27 @ X28 ),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
thf(c_0_15,negated_conjecture,
! [X7: $i,X3: mworld] :
( ( big_r @ X7 @ X7 @ X3 )
| ~ ( mrel @ ( esk5_1 @ X7 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,plain,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X7: $i] :
~ ( big_r @ ( esk4_1 @ X7 ) @ ( esk4_1 @ X7 ) @ ( esk6_1 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
! [X7: $i,X3: mworld] : ( big_r @ X7 @ X7 @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL957^6 : TPTP v8.2.0. Released v8.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n018.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 : Mon May 20 01:52:37 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.21/0.50 # new_ho_10 with pid 21535 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUNM-FFSF21-SHSSMFNN
% 0.21/0.50 # partial match(2): HGUNF-FFSF11-SHSSMFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting sh7 with 811s (1) cores
% 0.21/0.50 # Starting new_ho_10 with 151s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 136s (1) cores
% 0.21/0.50 # Starting lpo5_fix with 136s (1) cores
% 0.21/0.50 # Starting lpo1_def_fix with 136s (1) cores
% 0.21/0.50 # sh7 with pid 21539 completed with status 0
% 0.21/0.50 # Result found by sh7
% 0.21/0.50 # Preprocessing class: HSSSSMSSMLMNHSN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUNM-FFSF21-SHSSMFNN
% 0.21/0.50 # partial match(2): HGUNF-FFSF11-SHSSMFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting sh7 with 811s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 26
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 23
% 0.21/0.50 # Removed in clause preprocessing : 14
% 0.21/0.50 # Initial clauses in saturation : 9
% 0.21/0.50 # Processed clauses : 7
% 0.21/0.50 # ...of these trivial : 2
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 5
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 3
% 0.21/0.50 # Generated clauses : 0
% 0.21/0.50 # ...of the previous two non-redundant : 0
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 0
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 6
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 2
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 0
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 2
% 0.21/0.50 # ...number of literals in the above : 10
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 3
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 3
% 0.21/0.50 # BW rewrite match successes : 3
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1617
% 0.21/0.50 # Search garbage collected termcells : 648
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.002 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1912 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.011 s
% 0.21/0.50 # System time : 0.006 s
% 0.21/0.50 # Total time : 0.016 s
% 0.21/0.50 # Maximum resident set size: 1748 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------