TSTP Solution File: SEU519^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU519^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:27:55 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 26 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 83 ( 6 ~; 4 |; 3 &; 58 @)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
powerset: $i > $i ).
thf(decl_25,type,
emptysetE: $o ).
thf(decl_26,type,
powersetI: $o ).
thf(decl_27,type,
esk1_2: $i > $i > $i ).
thf(decl_28,type,
esk2_0: $i ).
thf(emptyinPowerset,conjecture,
( emptysetE
=> ( powersetI
=> ! [X3: $i] : ( in @ emptyset @ ( powerset @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptyinPowerset) ).
thf(powersetI,axiom,
( powersetI
<=> ! [X3: $i,X4: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X4 )
=> ( in @ X1 @ X3 ) )
=> ( in @ X4 @ ( powerset @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI) ).
thf(emptysetE,axiom,
( emptysetE
<=> ! [X1: $i] :
( ( in @ X1 @ emptyset )
=> ! [X2: $o] : X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X11: $i] :
( ( in @ X11 @ emptyset )
=> ! [X12: $o] : X12 )
=> ( ! [X13: $i,X14: $i] :
( ! [X15: $i] :
( ( in @ X15 @ X14 )
=> ( in @ X15 @ X13 ) )
=> ( in @ X14 @ ( powerset @ X13 ) ) )
=> ! [X3: $i] : ( in @ emptyset @ ( powerset @ X3 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[emptyinPowerset]),powersetI]),emptysetE]) ).
thf(c_0_4,negated_conjecture,
! [X16: $i,X17: $o,X18: $i,X19: $i] :
( ( ~ ( in @ X16 @ emptyset )
| X17 )
& ( ( in @ ( esk1_2 @ X18 @ X19 ) @ X19 )
| ( in @ X19 @ ( powerset @ X18 ) ) )
& ( ~ ( in @ ( esk1_2 @ X18 @ X19 ) @ X18 )
| ( in @ X19 @ ( powerset @ X18 ) ) )
& ~ ( in @ emptyset @ ( powerset @ 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] :
~ ( in @ X1 @ emptyset ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ X3 ) @ X3 )
| ( in @ X3 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( in @ emptyset @ ( powerset @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i] : ( in @ emptyset @ ( powerset @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU519^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 15:39:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 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.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho8 with 300s (1) cores
% 0.16/0.44 # Starting post_as_ho3 with 300s (1) cores
% 0.16/0.44 # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.44 # post_as_ho8 with pid 28198 completed with status 0
% 0.16/0.44 # Result found by post_as_ho8
% 0.16/0.44 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho8 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.16/0.44 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # new_ho_10 with pid 28201 completed with status 0
% 0.16/0.44 # Result found by new_ho_10
% 0.16/0.44 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho8 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.16/0.44 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 8
% 0.16/0.44 # Removed by relevancy pruning/SinE : 5
% 0.16/0.44 # Initial clauses : 4
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 4
% 0.16/0.44 # Processed clauses : 9
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 9
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 2
% 0.16/0.44 # ...of the previous two non-redundant : 2
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 2
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 1
% 0.16/0.44 # ...of those cached : 0
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 4
% 0.16/0.44 # Positive orientable unit clauses : 1
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 2
% 0.16/0.44 # Current number of unprocessed clauses: 1
% 0.16/0.44 # ...number of literals in the above : 1
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 5
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 2
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 2
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 2
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 1
% 0.16/0.44 # BW rewrite match successes : 1
% 0.16/0.44 # Condensation attempts : 9
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 474
% 0.16/0.44 # Search garbage collected termcells : 166
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.002 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.004 s
% 0.16/0.44 # Maximum resident set size: 1752 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.003 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.006 s
% 0.16/0.44 # Maximum resident set size: 1700 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------