TSTP Solution File: SEU621^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU621^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 03:28:38 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 22 ( 3 unt; 9 typ; 0 def)
% Number of atoms : 39 ( 5 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 124 ( 8 ~; 8 |; 4 &; 90 @)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 ^ 28 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
uniqinunit: $o ).
thf(decl_26,type,
subset: $i > $i > $o ).
thf(decl_27,type,
subsetI2: $o ).
thf(decl_28,type,
esk1_2: $i > $i > $i ).
thf(decl_29,type,
esk2_0: $i ).
thf(decl_30,type,
esk3_0: $i ).
thf(singletonsubset,conjecture,
( uniqinunit
=> ( subsetI2
=> ! [X3: $i,X1: $i] :
( ( in @ X1 @ X3 )
=> ( subset @ ( setadjoin @ X1 @ emptyset ) @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletonsubset) ).
thf(subsetI2,axiom,
( subsetI2
<=> ! [X3: $i,X4: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ( in @ X1 @ X4 ) )
=> ( subset @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2) ).
thf(uniqinunit,axiom,
( uniqinunit
<=> ! [X1: $i,X2: $i] :
( ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) )
=> ( X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uniqinunit) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X12: $i,X13: $i] :
( ( in @ X12 @ ( setadjoin @ X13 @ emptyset ) )
=> ( X12 = X13 ) )
=> ( ! [X14: $i,X15: $i] :
( ! [X16: $i] :
( ( in @ X16 @ X14 )
=> ( in @ X16 @ X15 ) )
=> ( subset @ X14 @ X15 ) )
=> ! [X3: $i,X1: $i] :
( ( in @ X1 @ X3 )
=> ( subset @ ( setadjoin @ X1 @ emptyset ) @ X3 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[singletonsubset]),subsetI2]),uniqinunit]) ).
thf(c_0_4,negated_conjecture,
! [X17: $i,X18: $i,X19: $i,X20: $i] :
( ( ~ ( in @ X17 @ ( setadjoin @ X18 @ emptyset ) )
| ( X17 = X18 ) )
& ( ( in @ ( esk1_2 @ X19 @ X20 ) @ X19 )
| ( subset @ X19 @ X20 ) )
& ( ~ ( in @ ( esk1_2 @ X19 @ X20 ) @ X20 )
| ( subset @ X19 @ X20 ) )
& ( in @ esk3_0 @ esk2_0 )
& ~ ( subset @ ( setadjoin @ esk3_0 @ emptyset ) @ esk2_0 ) ),
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_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ( in @ X1 @ ( setadjoin @ X2 @ emptyset ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 )
| ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i] :
( ( ( esk1_2 @ ( setadjoin @ X1 @ emptyset ) @ X2 )
= X1 )
| ( subset @ ( setadjoin @ X1 @ emptyset ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( subset @ ( setadjoin @ esk3_0 @ emptyset ) @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ ( setadjoin @ X1 @ emptyset ) @ X2 )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
in @ esk3_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU621^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.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 : Sun May 19 17:43:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.48 Running higher-order theorem proving
% 0.22/0.49 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.22/0.50 # Version: 3.1.0-ho
% 0.22/0.50 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.22/0.50 # Starting post_as_ho8 with 300s (1) cores
% 0.22/0.50 # Starting post_as_ho3 with 300s (1) cores
% 0.22/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.22/0.50 # post_as_ho8 with pid 9766 completed with status 0
% 0.22/0.50 # Result found by post_as_ho8
% 0.22/0.50 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.22/0.50 # Starting post_as_ho8 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.22/0.50 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # new_ho_10 with pid 9769 completed with status 0
% 0.22/0.50 # Result found by new_ho_10
% 0.22/0.50 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.22/0.50 # Starting post_as_ho8 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.22/0.50 # Search class: HGUSF-FFSF22-SFFFMFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 9
% 0.22/0.50 # Removed by relevancy pruning/SinE : 6
% 0.22/0.50 # Initial clauses : 5
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 5
% 0.22/0.50 # Processed clauses : 13
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 13
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.50 # Generated clauses : 5
% 0.22/0.50 # ...of the previous two non-redundant : 4
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 5
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 1
% 0.22/0.50 # ...of those cached : 0
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 8
% 0.22/0.50 # Positive orientable unit clauses : 2
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 1
% 0.22/0.50 # Non-unit-clauses : 5
% 0.22/0.50 # Current number of unprocessed clauses: 1
% 0.22/0.50 # ...number of literals in the above : 2
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 5
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 4
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.22/0.50 # Non-unit clause-clause subsumptions : 0
% 0.22/0.50 # Unit Clause-clause subsumption calls : 2
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 2
% 0.22/0.50 # BW rewrite match successes : 0
% 0.22/0.50 # Condensation attempts : 13
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 576
% 0.22/0.50 # Search garbage collected termcells : 189
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.004 s
% 0.22/0.50 # System time : 0.001 s
% 0.22/0.50 # Total time : 0.005 s
% 0.22/0.50 # Maximum resident set size: 1800 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.005 s
% 0.22/0.50 # System time : 0.004 s
% 0.22/0.50 # Total time : 0.009 s
% 0.22/0.50 # Maximum resident set size: 1696 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E exiting
%------------------------------------------------------------------------------