TSTP Solution File: SYO902^8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO902^8 : 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 08:50:34 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 31 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 59 ( 8 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 119 ( 14 ~; 9 |; 9 &; 81 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 36 ( 16 ^ 14 !; 6 ?; 36 :)
% 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_31,type,
mdia: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
p: mworld > $o ).
thf(decl_33,type,
esk1_0: mworld ).
thf(decl_34,type,
esk2_1: mworld > mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/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/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(mdia_def,axiom,
( mdia
= ( ^ [X1: mworld > $o,X3: mworld] :
? [X5: mworld] :
( ( mrel @ X3 @ X5 )
& ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mdia_def) ).
thf(con,conjecture,
mlocal @ ( mimplies @ ( mdia @ ( mbox @ ( mdia @ p ) ) ) @ ( mdia @ ( mdia @ p ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(mrel_reflexive,axiom,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
thf(c_0_6,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_7,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_8,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_9,plain,
( mdia
= ( ^ [Z0: mworld > $o,Z1: mworld] :
? [X5: mworld] :
( ( mrel @ Z1 @ X5 )
& ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_def]) ).
thf(c_0_10,negated_conjecture,
~ ( ? [X9: mworld] :
( ( mrel @ mactual @ X9 )
& ! [X8: mworld] :
( ( mrel @ X9 @ X8 )
=> ? [X7: mworld] :
( ( mrel @ X8 @ X7 )
& ( p @ X7 ) ) ) )
=> ? [X11: mworld] :
( ( mrel @ mactual @ X11 )
& ? [X10: mworld] :
( ( mrel @ X11 @ X10 )
& ( p @ X10 ) ) ) ),
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)],[con]),c_0_6]),c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X14: mworld,X16: mworld,X17: mworld] :
( ( mrel @ mactual @ esk1_0 )
& ( ( mrel @ X14 @ ( esk2_1 @ X14 ) )
| ~ ( mrel @ esk1_0 @ X14 ) )
& ( ( p @ ( esk2_1 @ X14 ) )
| ~ ( mrel @ esk1_0 @ X14 ) )
& ( ~ ( mrel @ mactual @ X16 )
| ~ ( mrel @ X16 @ X17 )
| ~ ( p @ X17 ) ) ),
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,negated_conjecture,
! [X3: mworld,X5: mworld] :
( ~ ( mrel @ mactual @ X3 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( p @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
mrel @ mactual @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,plain,
! [X12: mworld] : ( mrel @ X12 @ X12 ),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
thf(c_0_15,negated_conjecture,
! [X3: mworld] :
( ~ ( mrel @ esk1_0 @ X3 )
| ~ ( p @ X3 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X3: mworld] :
( ( mrel @ X3 @ ( esk2_1 @ X3 ) )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
~ ( p @ ( esk2_1 @ esk1_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
thf(c_0_19,negated_conjecture,
! [X3: mworld] :
( ( p @ ( esk2_1 @ X3 ) )
| ~ ( mrel @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO902^8 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:18:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 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.22/0.52 # Version: 3.1.0-ho
% 0.22/0.52 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting new_ho_9 with 1500s (5) cores
% 0.22/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.52 # Starting sh1l with 300s (1) cores
% 0.22/0.52 # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.52 # new_ho_9 with pid 22587 completed with status 0
% 0.22/0.52 # Result found by new_ho_9
% 0.22/0.52 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting new_ho_9 with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting sh7 with 811s (1) cores
% 0.22/0.52 # Starting new_ho_9 with 151s (1) cores
% 0.22/0.52 # Starting lpo1_lambda_fix with 136s (1) cores
% 0.22/0.52 # Starting new_ho_7 with 136s (1) cores
% 0.22/0.52 # Starting full_lambda_1 with 136s (1) cores
% 0.22/0.52 # new_ho_9 with pid 22592 completed with status 0
% 0.22/0.52 # Result found by new_ho_9
% 0.22/0.52 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting new_ho_9 with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting sh7 with 811s (1) cores
% 0.22/0.52 # Starting new_ho_9 with 151s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 22
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 17
% 0.22/0.52 # Removed in clause preprocessing : 12
% 0.22/0.52 # Initial clauses in saturation : 5
% 0.22/0.52 # Processed clauses : 18
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 2
% 0.22/0.52 # ...remaining for further processing : 16
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 0
% 0.22/0.52 # Backward-rewritten : 0
% 0.22/0.52 # Generated clauses : 9
% 0.22/0.52 # ...of the previous two non-redundant : 8
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 1
% 0.22/0.52 # Paramodulations : 9
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 2
% 0.22/0.52 # ...of those cached : 1
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 11
% 0.22/0.52 # Positive orientable unit clauses : 2
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 4
% 0.22/0.52 # Non-unit-clauses : 5
% 0.22/0.52 # Current number of unprocessed clauses: 0
% 0.22/0.52 # ...number of literals in the above : 0
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 5
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 5
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 3
% 0.22/0.52 # Non-unit clause-clause subsumptions : 1
% 0.22/0.52 # Unit Clause-clause subsumption calls : 4
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 5
% 0.22/0.52 # BW rewrite match successes : 0
% 0.22/0.52 # Condensation attempts : 18
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 989
% 0.22/0.52 # Search garbage collected termcells : 228
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.001 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.004 s
% 0.22/0.52 # Maximum resident set size: 1792 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.008 s
% 0.22/0.52 # System time : 0.008 s
% 0.22/0.52 # Total time : 0.016 s
% 0.22/0.52 # Maximum resident set size: 1732 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------