TSTP Solution File: LCL952^12 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL952^12 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:58 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of formulae : 18 ( 3 unt; 9 typ; 0 def)
% Number of atoms : 67 ( 2 equ; 0 cnn)
% Maximal formula atoms : 11 ( 7 avg)
% Number of connectives : 120 ( 2 ~; 0 |; 0 &; 112 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 12 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 22 ( 22 ^ 0 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
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_33,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_35,type,
qmltpeq: $i > $i > mworld > $o ).
thf(decl_36,type,
in: $i > $i > mworld > $o ).
thf(decl_38,type,
set_intersection2: $i > $i > $i ).
thf(decl_39,type,
singleton: $i > $i ).
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(l30_zfmisc_1,axiom,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X34: $i] :
( mbox
@ ( mforall_di
@ ^ [X35: $i] : ( mbox @ ( mimplies @ ( mbox @ ( qmltpeq @ ( set_intersection2 @ X34 @ ( singleton @ X35 ) ) @ ( singleton @ X35 ) ) ) @ ( mbox @ ( in @ X35 @ X34 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l30_zfmisc_1) ).
thf(t51_zfmisc_1,conjecture,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [X32: $i] :
( mbox
@ ( mforall_di
@ ^ [X33: $i] : ( mbox @ ( mimplies @ ( mbox @ ( qmltpeq @ ( set_intersection2 @ X32 @ ( singleton @ X33 ) ) @ ( singleton @ X33 ) ) ) @ ( mbox @ ( in @ X33 @ X32 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_zfmisc_1) ).
thf(c_0_3,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_4,plain,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [Z0: $i] :
( mbox
@ ( mforall_di
@ ^ [Z1: $i] :
( mbox
@ ^ [Z2: mworld] :
( ( mbox @ ( qmltpeq @ ( set_intersection2 @ Z0 @ ( singleton @ Z1 ) ) @ ( singleton @ Z1 ) ) @ Z2 )
=> ( mbox @ ( in @ Z1 @ Z0 ) @ Z2 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[l30_zfmisc_1]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
~ ( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [Z0: $i] :
( mbox
@ ( mforall_di
@ ^ [Z1: $i] :
( mbox
@ ^ [Z2: mworld] :
( ( mbox @ ( qmltpeq @ ( set_intersection2 @ Z0 @ ( singleton @ Z1 ) ) @ ( singleton @ Z1 ) ) @ Z2 )
=> ( mbox @ ( in @ Z1 @ Z0 ) @ Z2 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t51_zfmisc_1])]),c_0_3])]) ).
thf(c_0_6,plain,
( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [Z0: $i] :
( mbox
@ ( mforall_di
@ ^ [Z1: $i] :
( mbox
@ ^ [Z2: mworld] :
( ( mbox @ ( qmltpeq @ ( set_intersection2 @ Z0 @ ( singleton @ Z1 ) ) @ ( singleton @ Z1 ) ) @ Z2 )
=> ( mbox @ ( in @ Z1 @ Z0 ) @ Z2 ) ) ) ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( mlocal
@ ( mbox
@ ( mforall_di
@ ^ [Z0: $i] :
( mbox
@ ( mforall_di
@ ^ [Z1: $i] :
( mbox
@ ^ [Z2: mworld] :
( ( mbox @ ( qmltpeq @ ( set_intersection2 @ Z0 @ ( singleton @ Z1 ) ) @ ( singleton @ Z1 ) ) @ Z2 )
=> ( mbox @ ( in @ Z1 @ Z0 ) @ Z2 ) ) ) ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[c_0_6,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL952^12 : TPTP v8.2.0. Released v8.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 01:20:23 EDT 2024
% 0.20/0.35 % 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/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_12 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # new_bool_2 with pid 2996 completed with status 0
% 0.20/0.50 # Result found by new_bool_2
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_12 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: HUUNF-FFMM21-DHSSMFNN
% 0.20/0.50 # partial match(4): HGUNS-FFMF21-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 2997 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.20/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.20/0.50 # Starting new_ho_12 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: HUUNF-FFMM21-DHSSMFNN
% 0.20/0.50 # partial match(4): HGUNS-FFMF21-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 47
% 0.20/0.50 # Removed by relevancy pruning/SinE : 33
% 0.20/0.50 # Initial clauses : 12
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 12
% 0.20/0.50 # Processed clauses : 7
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 6
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 0
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 6
% 0.20/0.50 # Positive orientable unit clauses : 5
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 5
% 0.20/0.50 # ...number of literals in the above : 5
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 0
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 12
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 7
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 8640
% 0.20/0.50 # Search garbage collected termcells : 344
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.000 s
% 0.20/0.50 # Total time : 0.008 s
% 0.20/0.50 # Maximum resident set size: 1928 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1788 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------