TSTP Solution File: PLA053^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA053^5 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 02:19:23 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 25
% Syntax : Number of formulae : 48 ( 20 unt; 15 typ; 0 def)
% Number of atoms : 92 ( 12 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 196 ( 19 ~; 16 |; 8 &; 143 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 53 ( 53 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 67 ( 30 ^ 33 !; 4 ?; 67 :)
% 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_26,type,
mand: ( 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,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_33,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
h: $i > mworld > $o ).
thf(decl_35,type,
bomb: $i > mworld > $o ).
thf(decl_36,type,
defused: $i > mworld > $o ).
thf(decl_39,type,
esk3_2: mworld > $i > $i ).
thf(decl_40,type,
esk4_0: mworld ).
thf(decl_41,type,
esk5_0: $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand_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
= ( ^ [X7: $i > mworld > $o,X3: mworld] :
! [X8: $i] : ( X7 @ X8 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mforall_di_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X9: $i > mworld > $o,X3: mworld] :
? [X8: $i] : ( X9 @ X8 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mexists_di_def) ).
thf(con,conjecture,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X8: $i] :
( mexists_di
@ ^ [X12: $i] : ( mimplies @ ( mand @ ( bomb @ X8 ) @ ( h @ X12 ) ) @ ( defused @ X8 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(ax3,axiom,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X8: $i] :
( mexists_di
@ ^ [X12: $i] : ( mbox @ ( mimplies @ ( mand @ ( bomb @ X8 ) @ ( h @ X12 ) ) @ ( defused @ X8 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
thf(mrel_euclidean,axiom,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( ( mrel @ X3 @ X6 )
& ( mrel @ X3 @ X5 ) )
=> ( mrel @ X6 @ X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_euclidean) ).
thf(mrel_reflexive,axiom,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
thf(c_0_10,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_11,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_13,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_14,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X8: $i] : ( Z0 @ X8 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_15,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X8: $i] : ( Z0 @ X8 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_16,negated_conjecture,
~ ! [X29: mworld] :
( ( mrel @ mactual @ X29 )
=> ! [X28: $i] :
? [X27: $i] :
( ( ( bomb @ X28 @ X29 )
& ( h @ X27 @ X29 ) )
=> ( defused @ X28 @ X29 ) ) ),
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(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]) ).
thf(c_0_17,plain,
! [X26: mworld] :
( ( mrel @ mactual @ X26 )
=> ! [X25: $i] :
? [X24: $i] :
! [X23: mworld] :
( ( mrel @ X26 @ X23 )
=> ( ( ( bomb @ X25 @ X23 )
& ( h @ X24 @ X23 ) )
=> ( defused @ X25 @ X23 ) ) ) ),
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(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax3]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]) ).
thf(c_0_18,plain,
! [X31: mworld,X32: mworld,X33: mworld] :
( ~ ( mrel @ X31 @ X33 )
| ~ ( mrel @ X31 @ X32 )
| ( mrel @ X33 @ X32 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mrel_euclidean])])]) ).
thf(c_0_19,negated_conjecture,
! [X46: $i] :
( ( mrel @ mactual @ esk4_0 )
& ( bomb @ esk5_0 @ esk4_0 )
& ( h @ X46 @ esk4_0 )
& ~ ( defused @ esk5_0 @ 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_16])])])])]) ).
thf(c_0_20,plain,
! [X40: mworld,X41: $i,X43: mworld] :
( ~ ( mrel @ mactual @ X40 )
| ~ ( mrel @ X40 @ X43 )
| ~ ( bomb @ X41 @ X43 )
| ~ ( h @ ( esk3_2 @ X40 @ X41 ) @ X43 )
| ( defused @ X41 @ X43 ) ),
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_21,plain,
! [X3: mworld,X5: mworld,X6: mworld] :
( ( mrel @ X5 @ X6 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( mrel @ X3 @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_22,negated_conjecture,
mrel @ mactual @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_23,plain,
! [X8: $i,X3: mworld,X5: mworld] :
( ( defused @ X8 @ X5 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( mrel @ X3 @ X5 )
| ~ ( bomb @ X8 @ X5 )
| ~ ( h @ ( esk3_2 @ X3 @ X8 ) @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X8: $i] : ( h @ X8 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_25,negated_conjecture,
! [X3: mworld] :
( ( mrel @ X3 @ esk4_0 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_26,plain,
! [X30: mworld] : ( mrel @ X30 @ X30 ),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
thf(c_0_27,negated_conjecture,
! [X3: mworld,X8: $i] :
( ( defused @ X8 @ esk4_0 )
| ~ ( mrel @ mactual @ X3 )
| ~ ( bomb @ X8 @ esk4_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
thf(c_0_28,plain,
! [X3: mworld] : ( mrel @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_29,negated_conjecture,
~ ( defused @ esk5_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_30,negated_conjecture,
! [X8: $i] :
( ( defused @ X8 @ esk4_0 )
| ~ ( bomb @ X8 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_31,negated_conjecture,
bomb @ esk5_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PLA053^5 : TPTP v8.2.0. Released v8.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 13:41:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # almost_fo_3_lam with pid 4409 completed with status 0
% 0.20/0.49 # Result found by almost_fo_3_lam
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HHUNS-FFSF21-SHSSMFNN
% 0.20/0.49 # partial match(2): HHHNS-FFSF11-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # new_ho_10 with pid 4413 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HHUNS-FFSF21-SHSSMFNN
% 0.20/0.49 # partial match(2): HHHNS-FFSF11-SHSSMFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 32
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 25
% 0.20/0.49 # Removed in clause preprocessing : 16
% 0.20/0.49 # Initial clauses in saturation : 9
% 0.20/0.49 # Processed clauses : 24
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 24
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 15
% 0.20/0.49 # ...of the previous two non-redundant : 8
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 15
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 8
% 0.20/0.49 # ...of those cached : 2
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 14
% 0.20/0.49 # Positive orientable unit clauses : 5
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 8
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 5
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 10
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 19
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 13
% 0.20/0.49 # Non-unit clause-clause subsumptions : 2
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 2
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 24
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 2112
% 0.20/0.49 # Search garbage collected termcells : 657
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1896 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.011 s
% 0.20/0.49 # Maximum resident set size: 1756 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------