TSTP Solution File: PUZ150^18 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : PUZ150^18 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 Jun 24 13:43:43 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 20 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 8 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 97 ( 10 ~; 2 |; 7 &; 74 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 35 ( 18 ^ 13 !; 4 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mindex: $tType ).
thf(decl_sort2,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mindex > mworld > mworld > $o ).
thf(decl_23,type,
'#c': mindex ).
thf(decl_24,type,
'#b': mindex ).
thf(decl_25,type,
'#a': mindex ).
thf(decl_26,type,
mactual: mworld ).
thf(decl_27,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_28,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(decl_33,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(decl_34,type,
mdia: mindex > ( mworld > $o ) > mworld > $o ).
thf(decl_40,type,
a0: mworld > $o ).
thf(decl_45,type,
esk1_0: mworld ).
thf(decl_46,type,
esk2_0: mworld ).
thf(decl_47,type,
esk3_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z95XD098Tu/E---3.1_26475.p',mlocal_def) ).
thf(mnot_def,axiom,
( mnot
= ( ^ [X2: mworld > $o,X3: mworld] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z95XD098Tu/E---3.1_26475.p',mnot_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
! [X6: mworld] :
( ( mrel @ X5 @ X3 @ X6 )
=> ( X1 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z95XD098Tu/E---3.1_26475.p',mbox_def) ).
thf(mdia_def,axiom,
( mdia
= ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
? [X6: mworld] :
( ( mrel @ X5 @ X3 @ X6 )
& ( X1 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z95XD098Tu/E---3.1_26475.p',mdia_def) ).
thf(con,conjecture,
mlocal @ ( mbox @ '#b' @ ( mnot @ ( mdia @ '#a' @ ( mdia @ '#b' @ ( mbox @ '#c' @ ( mnot @ a0 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Z95XD098Tu/E---3.1_26475.p',con) ).
thf('mrel_#c_universal',axiom,
! [X3: mworld,X6: mworld] : ( mrel @ '#c' @ X3 @ X6 ),
file('/export/starexec/sandbox2/tmp/tmp.Z95XD098Tu/E---3.1_26475.p','mrel_#c_universal') ).
thf(axiom_a0,axiom,
mlocal @ a0,
file('/export/starexec/sandbox2/tmp/tmp.Z95XD098Tu/E---3.1_26475.p',axiom_a0) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_8,plain,
( mnot
= ( ^ [Z0: mworld > $o,Z1: mworld] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot_def]) ).
thf(c_0_9,plain,
( mbox
= ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
! [X6: mworld] :
( ( mrel @ Z0 @ Z2 @ X6 )
=> ( Z1 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_10,plain,
( mdia
= ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
? [X6: mworld] :
( ( mrel @ Z0 @ Z2 @ X6 )
& ( Z1 @ X6 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_def]) ).
thf(c_0_11,negated_conjecture,
~ ! [X51: mworld] :
( ( mrel @ '#b' @ mactual @ X51 )
=> ~ ? [X50: mworld] :
( ( mrel @ '#a' @ X51 @ X50 )
& ? [X49: mworld] :
( ( mrel @ '#b' @ X50 @ X49 )
& ! [X48: mworld] :
( ( mrel @ '#c' @ X49 @ X48 )
=> ~ ( a0 @ X48 ) ) ) ) ),
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(assume_negation,[status(cth)],[con]),c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
thf(c_0_12,negated_conjecture,
! [X96: mworld] :
( ( mrel @ '#b' @ mactual @ esk1_0 )
& ( mrel @ '#a' @ esk1_0 @ esk2_0 )
& ( mrel @ '#b' @ esk2_0 @ esk3_0 )
& ( ~ ( mrel @ '#c' @ esk3_0 @ X96 )
| ~ ( a0 @ X96 ) ) ),
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_11])])])])]) ).
thf(c_0_13,plain,
! [X52: mworld,X53: mworld] : ( mrel @ '#c' @ X52 @ X53 ),
inference(variable_rename,[status(thm)],['mrel_#c_universal']) ).
thf(c_0_14,plain,
a0 @ mactual,
inference(apply_def,[status(thm)],[axiom_a0,c_0_7]) ).
thf(c_0_15,negated_conjecture,
! [X3: mworld] :
( ~ ( mrel @ '#c' @ esk3_0 @ X3 )
| ~ ( a0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,plain,
! [X3: mworld,X6: mworld] : ( mrel @ '#c' @ X3 @ X6 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
a0 @ mactual,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
! [X3: mworld] :
~ ( a0 @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ150^18 : TPTP v8.2.0. Released v8.1.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 09:56:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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/tmp/tmp.Z95XD098Tu/E---3.1_26475.p
% 0.20/0.49 # Version: 3.2.0-ho
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho11 with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_8 with 300s (1) cores
% 0.20/0.49 # post_as_ho3 with pid 26554 completed with status 0
% 0.20/0.49 # Result found by post_as_ho3
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNS-FFMS00-SHSSMFNN
% 0.20/0.49 # partial match(2): HGHNF-FFSS00-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 26558 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSMSSMSSMLSNHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGHNS-FFMS00-SHSSMFNN
% 0.20/0.49 # partial match(2): HGHNF-FFSS00-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.002 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 : 45
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 40
% 0.20/0.49 # Removed in clause preprocessing : 25
% 0.20/0.49 # Initial clauses in saturation : 15
% 0.20/0.49 # Processed clauses : 7
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 7
% 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 : 0
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 1
% 0.20/0.49 # ...of the previous two non-redundant : 1
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 0
% 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 : 1
% 0.20/0.49 # ...of those cached : 0
% 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 : 5
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 9
% 0.20/0.49 # ...number of literals in the above : 58
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 2
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 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 : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 7
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3922
% 0.20/0.49 # Search garbage collected termcells : 1537
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 2108 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.009 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.012 s
% 0.20/0.49 # Maximum resident set size: 1756 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------