TSTP Solution File: SEU711^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU711^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:22 EDT 2024
% Result : Theorem 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 4 unt; 10 typ; 0 def)
% Number of atoms : 74 ( 0 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 304 ( 20 ~; 29 |; 9 &; 215 @)
% ( 3 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 53 ( 0 ^ 53 !; 0 ?; 53 :)
% 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,
binunion: $i > $i > $i ).
thf(decl_27,type,
binunionEcases: $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(decl_31,type,
esk4_0: $i ).
thf(binunionT_lem,conjecture,
( powersetI
=> ( powersetE
=> ( binunionEcases
=> ! [X1: $i,X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X6: $i] :
( ( in @ X6 @ ( powerset @ X1 ) )
=> ( in @ ( binunion @ X5 @ X6 ) @ ( powerset @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionT_lem) ).
thf(binunionEcases,axiom,
( binunionEcases
<=> ! [X1: $i,X2: $i,X3: $i,X4: $o] :
( ( in @ X3 @ ( binunion @ X1 @ X2 ) )
=> ( ( ( in @ X3 @ X1 )
=> X4 )
=> ( ( ( in @ X3 @ X2 )
=> X4 )
=> X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionEcases) ).
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(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(c_0_4,negated_conjecture,
~ ( ! [X20: $i,X21: $i] :
( ! [X22: $i] :
( ( in @ X22 @ X21 )
=> ( in @ X22 @ X20 ) )
=> ( in @ X21 @ ( powerset @ X20 ) ) )
=> ( ! [X23: $i,X24: $i,X25: $i] :
( ( in @ X24 @ ( powerset @ X23 ) )
=> ( ( in @ X25 @ X24 )
=> ( in @ X25 @ X23 ) ) )
=> ( ! [X26: $i,X27: $i,X28: $i,X29: $o] :
( ( in @ X28 @ ( binunion @ X26 @ X27 ) )
=> ( ( ( in @ X28 @ X26 )
=> X29 )
=> ( ( ( in @ X28 @ X27 )
=> X29 )
=> X29 ) ) )
=> ! [X1: $i,X5: $i] :
( ( in @ X5 @ ( powerset @ X1 ) )
=> ! [X6: $i] :
( ( in @ X6 @ ( powerset @ X1 ) )
=> ( in @ ( binunion @ X5 @ X6 ) @ ( powerset @ X1 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[binunionT_lem]),binunionEcases]),powersetI]),powersetE]) ).
thf(c_0_5,negated_conjecture,
! [X30: $i,X31: $i,X33: $i,X34: $i,X35: $i,X36: $i,X37: $i,X38: $i,X39: $o] :
( ( ( in @ ( esk1_2 @ X30 @ X31 ) @ X31 )
| ( in @ X31 @ ( powerset @ X30 ) ) )
& ( ~ ( in @ ( esk1_2 @ X30 @ X31 ) @ X30 )
| ( in @ X31 @ ( powerset @ X30 ) ) )
& ( ~ ( in @ X34 @ ( powerset @ X33 ) )
| ~ ( in @ X35 @ X34 )
| ( in @ X35 @ X33 ) )
& ( ( in @ X38 @ X37 )
| X39
| ( in @ X38 @ X36 )
| ~ ( in @ X38 @ ( binunion @ X36 @ X37 ) ) )
& ( ~ X39
| X39
| ( in @ X38 @ X36 )
| ~ ( in @ X38 @ ( binunion @ X36 @ X37 ) ) )
& ( ( in @ X38 @ X37 )
| X39
| ~ X39
| ~ ( in @ X38 @ ( binunion @ X36 @ X37 ) ) )
& ( ~ X39
| X39
| ~ X39
| ~ ( in @ X38 @ ( binunion @ X36 @ X37 ) ) )
& ( in @ esk3_0 @ ( powerset @ esk2_0 ) )
& ( in @ esk4_0 @ ( powerset @ esk2_0 ) )
& ~ ( in @ ( binunion @ esk3_0 @ esk4_0 ) @ ( 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_4])])])])])]) ).
thf(c_0_6,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_5]) ).
thf(c_0_7,negated_conjecture,
in @ esk3_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ X1 @ X2 )
| ( in @ X1 @ X3 )
| ~ ( in @ X1 @ ( binunion @ X3 @ X2 ) ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 )
| ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
in @ esk4_0 @ ( powerset @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_12,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ ( binunion @ X2 @ X3 ) ) @ X3 )
| ( in @ ( esk1_2 @ X1 @ ( binunion @ X2 @ X3 ) ) @ X2 )
| ( in @ ( binunion @ X2 @ X3 ) @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk2_0 )
| ~ ( in @ X1 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ ( binunion @ esk3_0 @ X2 ) ) @ esk2_0 )
| ( in @ ( esk1_2 @ X1 @ ( binunion @ esk3_0 @ X2 ) ) @ X2 )
| ( in @ ( binunion @ esk3_0 @ X2 ) @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ X2 @ ( powerset @ X1 ) )
| ~ ( in @ ( esk1_2 @ X1 @ X2 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk1_2 @ X1 @ ( binunion @ esk3_0 @ esk4_0 ) ) @ esk2_0 )
| ( in @ ( binunion @ esk3_0 @ esk4_0 ) @ ( powerset @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
~ ( in @ ( binunion @ esk3_0 @ esk4_0 ) @ ( powerset @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : SEU711^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n021.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun May 19 15:25:37 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.12/0.38 Running higher-order theorem proving
% 0.12/0.38 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.12/0.40 # Version: 3.1.0-ho
% 0.12/0.40 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.12/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.12/0.40 # Starting post_as_ho8 with 300s (1) cores
% 0.12/0.40 # Starting post_as_ho3 with 300s (1) cores
% 0.12/0.40 # Starting post_as_ho2 with 300s (1) cores
% 0.12/0.40 # post_as_ho8 with pid 29553 completed with status 0
% 0.12/0.40 # Result found by post_as_ho8
% 0.12/0.40 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.12/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.12/0.40 # Starting post_as_ho8 with 300s (1) cores
% 0.12/0.40 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.12/0.40 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.12/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.40 # Starting new_ho_10 with 163s (1) cores
% 0.12/0.40 # new_ho_10 with pid 29556 completed with status 0
% 0.12/0.40 # Result found by new_ho_10
% 0.12/0.40 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.12/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.12/0.40 # Starting post_as_ho8 with 300s (1) cores
% 0.12/0.40 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.12/0.40 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.12/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.40 # Starting new_ho_10 with 163s (1) cores
% 0.12/0.40 # Preprocessing time : 0.001 s
% 0.12/0.40 # Presaturation interreduction done
% 0.12/0.40
% 0.12/0.40 # Proof found!
% 0.12/0.40 # SZS status Theorem
% 0.12/0.40 # SZS output start CNFRefutation
% See solution above
% 0.12/0.40 # Parsed axioms : 10
% 0.12/0.40 # Removed by relevancy pruning/SinE : 6
% 0.12/0.40 # Initial clauses : 10
% 0.12/0.40 # Removed in clause preprocessing : 3
% 0.12/0.40 # Initial clauses in saturation : 7
% 0.12/0.40 # Processed clauses : 56
% 0.12/0.40 # ...of these trivial : 0
% 0.12/0.40 # ...subsumed : 6
% 0.12/0.40 # ...remaining for further processing : 50
% 0.12/0.40 # Other redundant clauses eliminated : 0
% 0.12/0.40 # Clauses deleted for lack of memory : 0
% 0.12/0.40 # Backward-subsumed : 0
% 0.12/0.40 # Backward-rewritten : 0
% 0.12/0.40 # Generated clauses : 318
% 0.12/0.40 # ...of the previous two non-redundant : 312
% 0.12/0.40 # ...aggressively subsumed : 0
% 0.12/0.40 # Contextual simplify-reflections : 0
% 0.12/0.40 # Paramodulations : 292
% 0.12/0.40 # Factorizations : 26
% 0.12/0.40 # NegExts : 0
% 0.12/0.40 # Equation resolutions : 0
% 0.12/0.40 # Disequality decompositions : 0
% 0.12/0.40 # Total rewrite steps : 4
% 0.12/0.40 # ...of those cached : 1
% 0.12/0.40 # Propositional unsat checks : 0
% 0.12/0.40 # Propositional check models : 0
% 0.12/0.40 # Propositional check unsatisfiable : 0
% 0.12/0.40 # Propositional clauses : 0
% 0.12/0.40 # Propositional clauses after purity: 0
% 0.12/0.40 # Propositional unsat core size : 0
% 0.12/0.40 # Propositional preprocessing time : 0.000
% 0.12/0.40 # Propositional encoding time : 0.000
% 0.12/0.40 # Propositional solver time : 0.000
% 0.12/0.40 # Success case prop preproc time : 0.000
% 0.12/0.40 # Success case prop encoding time : 0.000
% 0.12/0.40 # Success case prop solver time : 0.000
% 0.12/0.40 # Current number of processed clauses : 43
% 0.12/0.40 # Positive orientable unit clauses : 7
% 0.12/0.40 # Positive unorientable unit clauses: 0
% 0.12/0.40 # Negative unit clauses : 1
% 0.12/0.40 # Non-unit-clauses : 35
% 0.12/0.40 # Current number of unprocessed clauses: 270
% 0.12/0.40 # ...number of literals in the above : 1040
% 0.12/0.40 # Current number of archived formulas : 0
% 0.12/0.40 # Current number of archived clauses : 7
% 0.12/0.40 # Clause-clause subsumption calls (NU) : 575
% 0.12/0.40 # Rec. Clause-clause subsumption calls : 294
% 0.12/0.40 # Non-unit clause-clause subsumptions : 6
% 0.12/0.40 # Unit Clause-clause subsumption calls : 15
% 0.12/0.40 # Rewrite failures with RHS unbound : 0
% 0.12/0.40 # BW rewrite match attempts : 8
% 0.12/0.40 # BW rewrite match successes : 0
% 0.12/0.40 # Condensation attempts : 56
% 0.12/0.40 # Condensation successes : 0
% 0.12/0.40 # Termbank termtop insertions : 9065
% 0.12/0.40 # Search garbage collected termcells : 383
% 0.12/0.40
% 0.12/0.40 # -------------------------------------------------
% 0.12/0.40 # User time : 0.015 s
% 0.12/0.40 # System time : 0.000 s
% 0.12/0.40 # Total time : 0.015 s
% 0.12/0.40 # Maximum resident set size: 1908 pages
% 0.12/0.40
% 0.12/0.40 # -------------------------------------------------
% 0.12/0.40 # User time : 0.015 s
% 0.12/0.40 # System time : 0.003 s
% 0.12/0.40 # Total time : 0.018 s
% 0.12/0.40 # Maximum resident set size: 1704 pages
% 0.12/0.40 % E---3.1 exiting
% 0.12/0.41 % E exiting
%------------------------------------------------------------------------------