TSTP Solution File: SYO566^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO566^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 08:48:05 EDT 2024
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 42 ( 22 unt; 14 typ; 0 def)
% Number of atoms : 79 ( 15 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 153 ( 22 ~; 18 |; 3 &; 105 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 55 ( 33 ^ 22 !; 0 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_36,type,
exists_in_world: mu > $i > $o ).
thf(decl_37,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_s4: $i > $i > $o ).
thf(decl_55,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
g: mu > $i > $o ).
thf(decl_58,type,
f: mu > $i > $o ).
thf(decl_60,type,
esk2_0: $i ).
thf(decl_61,type,
esk3_0: mu ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ X3 )
=> ( X11 @ X12 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mvalid) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X4: $i > $o,X3: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ X3 @ X7 )
| ( X4 @ X7 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax',mbox_s4) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i] : ( X6 @ X16 @ X16 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax',mreflexive) ).
thf(con,conjecture,
( mvalid
@ ( mimplies
@ ( mbox_s4
@ ( mforall_ind
@ ^ [X20: mu] : ( mimplies @ ( f @ X20 ) @ ( g @ X20 ) ) ) )
@ ( mimplies
@ ( mforall_ind
@ ^ [X21: mu] : ( f @ X21 ) )
@ ( mforall_ind
@ ^ [X22: mu] : ( g @ X22 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax',a1) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_13,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ Z1 )
=> ( Z0 @ X12 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_14,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_15,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ Z1 @ X7 )
| ( Z0 @ X7 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_16,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i] : ( Z0 @ X16 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_17,negated_conjecture,
~ ! [X40: $i] :
( ~ ! [X37: $i] :
( ~ ( rel_s4 @ X40 @ X37 )
| ! [X36: mu] :
( ( exists_in_world @ X36 @ X37 )
=> ( ~ ( f @ X36 @ X37 )
| ( g @ X36 @ X37 ) ) ) )
| ~ ! [X38: mu] :
( ( exists_in_world @ X38 @ X40 )
=> ( f @ X38 @ X40 ) )
| ! [X39: mu] :
( ( exists_in_world @ X39 @ X40 )
=> ( g @ X39 @ X40 ) ) ),
inference(fof_simplification,[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)],[con])]),c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
thf(c_0_18,plain,
! [X32: $i] : ( rel_s4 @ X32 @ X32 ),
inference(apply_def,[status(thm)],[a1,c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X51: $i,X52: mu,X53: mu] :
( ( ~ ( rel_s4 @ esk2_0 @ X51 )
| ~ ( exists_in_world @ X52 @ X51 )
| ~ ( f @ X52 @ X51 )
| ( g @ X52 @ X51 ) )
& ( ~ ( exists_in_world @ X53 @ esk2_0 )
| ( f @ X53 @ esk2_0 ) )
& ( exists_in_world @ esk3_0 @ esk2_0 )
& ~ ( g @ esk3_0 @ esk2_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_17])])])])]) ).
thf(c_0_20,plain,
! [X43: $i] : ( rel_s4 @ X43 @ X43 ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
thf(c_0_21,negated_conjecture,
~ ( g @ esk3_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X10: mu,X3: $i] :
( ( g @ X10 @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 )
| ~ ( f @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_23,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
exists_in_world @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_25,negated_conjecture,
~ ( f @ esk3_0 @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
thf(c_0_26,negated_conjecture,
! [X10: mu] :
( ( f @ X10 @ esk2_0 )
| ~ ( exists_in_world @ X10 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SYO566^7 : TPTP v8.2.0. Released v5.5.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 08:44:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running higher-order theorem proving
% 0.16/0.42 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.16/0.43 # Version: 3.1.0-ho
% 0.16/0.43 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.16/0.43 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.43 # Starting almost_fo_3_lam with 300s (1) cores
% 0.16/0.43 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.43 # almost_fo_3_lam with pid 25222 completed with status 0
% 0.16/0.43 # Result found by almost_fo_3_lam
% 0.16/0.43 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.16/0.43 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.43 # Starting almost_fo_3_lam with 300s (1) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: HHUNS-FFSF11-SHSSMFNN
% 0.16/0.43 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.16/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.43 # new_ho_10 with pid 25224 completed with status 0
% 0.16/0.43 # Result found by new_ho_10
% 0.16/0.43 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.16/0.43 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.43 # Starting almost_fo_3_lam with 300s (1) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: HHUNS-FFSF11-SHSSMFNN
% 0.16/0.43 # partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.16/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 75
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 46
% 0.16/0.43 # Removed in clause preprocessing : 38
% 0.16/0.43 # Initial clauses in saturation : 8
% 0.16/0.43 # Processed clauses : 17
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 17
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 0
% 0.16/0.43 # Generated clauses : 4
% 0.16/0.43 # ...of the previous two non-redundant : 1
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 4
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 3
% 0.16/0.43 # ...of those cached : 1
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 9
% 0.16/0.43 # Positive orientable unit clauses : 3
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 2
% 0.16/0.43 # Non-unit-clauses : 4
% 0.16/0.43 # Current number of unprocessed clauses: 0
% 0.16/0.43 # ...number of literals in the above : 0
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 8
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 2
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 2
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 0
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 0
% 0.16/0.43 # BW rewrite match successes : 0
% 0.16/0.43 # Condensation attempts : 17
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 2740
% 0.16/0.43 # Search garbage collected termcells : 596
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.004 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.006 s
% 0.16/0.43 # Maximum resident set size: 1908 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.008 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.010 s
% 0.16/0.43 # Maximum resident set size: 1800 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------