TSTP Solution File: SEU712^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU712^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:29:23 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 23 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 52 ( 0 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 208 ( 11 ~; 16 |; 4 &; 161 @)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 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 : 38 ( 0 ^ 38 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
powerset: $i > $i ).
thf(decl_24,type,
powersetI: $o ).
thf(decl_25,type,
powersetE: $o ).
thf(decl_26,type,
esk1_2: $i > $i > $i ).
thf(decl_27,type,
esk2_0: $i ).
thf(decl_28,type,
esk3_0: $i ).
thf(powersetT_lem,conjecture,
( powersetI
=> ( powersetE
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( in @ ( powerset @ X4 ) @ ( powerset @ ( powerset @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetT_lem) ).
thf(powersetE,axiom,
( powersetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
=> ( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetE) ).
thf(powersetI,axiom,
( powersetI
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) )
=> ( in @ X2 @ ( powerset @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',powersetI) ).
thf(c_0_3,negated_conjecture,
~ ( ! [X13: $i,X14: $i] :
( ! [X15: $i] :
( ( in @ X15 @ X14 )
=> ( in @ X15 @ X13 ) )
=> ( in @ X14 @ ( powerset @ X13 ) ) )
=> ( ! [X16: $i,X17: $i,X18: $i] :
( ( in @ X17 @ ( powerset @ X16 ) )
=> ( ( in @ X18 @ X17 )
=> ( in @ X18 @ X16 ) ) )
=> ! [X1: $i,X4: $i] :
( ( in @ X4 @ ( powerset @ X1 ) )
=> ( in @ ( powerset @ X4 ) @ ( powerset @ ( powerset @ X1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[powersetT_lem]),powersetE]),powersetI]) ).
thf(c_0_4,negated_conjecture,
! [X19: $i,X20: $i,X22: $i,X23: $i,X24: $i] :
( ( ( in @ ( esk1_2 @ X19 @ X20 ) @ X20 )
| ( in @ X20 @ ( powerset @ X19 ) ) )
& ( ~ ( in @ ( esk1_2 @ X19 @ X20 ) @ X19 )
| ( in @ X20 @ ( powerset @ X19 ) ) )
& ( ~ ( in @ X23 @ ( powerset @ X22 ) )
| ~ ( in @ X24 @ X23 )
| ( in @ X24 @ X22 ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ~ ( in @ ( powerset @ esk3_0 ) @ ( powerset @ ( 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,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( in @ X1 @ ( powerset @ X2 ) )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 )
| ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( powerset @ X1 ) @ ( powerset @ X2 ) )
| ( in @ X3 @ X1 )
| ~ ( in @ X3 @ ( esk1_2 @ X2 @ ( powerset @ X1 ) ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ ( esk1_2 @ X2 @ ( powerset @ X3 ) ) ) @ X3 )
| ( in @ ( esk1_2 @ X2 @ ( powerset @ X3 ) ) @ ( powerset @ X1 ) )
| ( in @ ( powerset @ X3 ) @ ( powerset @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ ( esk1_2 @ X2 @ ( powerset @ esk3_0 ) ) ) @ esk2_0 )
| ( in @ ( esk1_2 @ X2 @ ( powerset @ esk3_0 ) ) @ ( powerset @ X1 ) )
| ( in @ ( powerset @ esk3_0 ) @ ( powerset @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk1_2 @ X1 @ ( powerset @ esk3_0 ) ) @ ( powerset @ esk2_0 ) )
| ( in @ ( powerset @ esk3_0 ) @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
~ ( in @ ( powerset @ esk3_0 ) @ ( powerset @ ( powerset @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU712^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.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:10:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/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.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.49 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.49 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.49 # post_as_ho8 with pid 25604 completed with status 0
% 0.21/0.49 # Result found by post_as_ho8
% 0.21/0.49 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.49 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49 # new_ho_10 with pid 25607 completed with status 0
% 0.21/0.49 # Result found by new_ho_10
% 0.21/0.49 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.49 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.21/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 7
% 0.21/0.49 # Removed by relevancy pruning/SinE : 4
% 0.21/0.49 # Initial clauses : 5
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 5
% 0.21/0.49 # Processed clauses : 20
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 1
% 0.21/0.49 # ...remaining for further processing : 19
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 0
% 0.21/0.49 # Generated clauses : 21
% 0.21/0.49 # ...of the previous two non-redundant : 18
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 21
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 1
% 0.21/0.49 # ...of those cached : 0
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 14
% 0.21/0.49 # Positive orientable unit clauses : 2
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 11
% 0.21/0.49 # Current number of unprocessed clauses: 7
% 0.21/0.49 # ...number of literals in the above : 32
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 5
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 77
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 45
% 0.21/0.49 # Non-unit clause-clause subsumptions : 1
% 0.21/0.49 # Unit Clause-clause subsumption calls : 2
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 4
% 0.21/0.49 # BW rewrite match successes : 0
% 0.21/0.49 # Condensation attempts : 20
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 1308
% 0.21/0.49 # Search garbage collected termcells : 219
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.005 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.007 s
% 0.21/0.49 # Maximum resident set size: 1736 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.006 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.010 s
% 0.21/0.49 # Maximum resident set size: 1696 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------