TSTP Solution File: SEU579^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU579^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:19 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 32 ( 3 unt; 11 typ; 0 def)
% Number of atoms : 82 ( 0 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 287 ( 17 ~; 24 |; 7 &; 209 @)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 62 ( 0 ^ 62 !; 0 ?; 62 :)
% 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,
subset: $i > $i > $o ).
thf(decl_27,type,
subsetI2: $o ).
thf(decl_28,type,
subsetE: $o ).
thf(decl_29,type,
esk1_2: $i > $i > $i ).
thf(decl_30,type,
esk2_2: $i > $i > $i ).
thf(decl_31,type,
esk3_0: $i ).
thf(decl_32,type,
esk4_0: $i ).
thf(powersetsubset,conjecture,
( powersetI
=> ( powersetE
=> ( subsetI2
=> ( subsetE
=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( subset @ ( powerset @ X1 ) @ ( powerset @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetsubset) ).
thf(powersetI,axiom,
( powersetI
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( in @ X3 @ X1 ) )
=> ( in @ X2 @ ( powerset @ X1 ) ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',powersetE) ).
thf(subsetI2,axiom,
( subsetI2
<=> ! [X1: $i,X2: $i] :
( ! [X3: $i] :
( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) )
=> ( subset @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetI2) ).
thf(subsetE,axiom,
( subsetE
<=> ! [X1: $i,X2: $i,X3: $i] :
( ( subset @ X1 @ X2 )
=> ( ( in @ X3 @ X1 )
=> ( in @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE) ).
thf(c_0_5,negated_conjecture,
~ ( ! [X18: $i,X19: $i] :
( ! [X20: $i] :
( ( in @ X20 @ X19 )
=> ( in @ X20 @ X18 ) )
=> ( in @ X19 @ ( powerset @ X18 ) ) )
=> ( ! [X21: $i,X22: $i,X23: $i] :
( ( in @ X22 @ ( powerset @ X21 ) )
=> ( ( in @ X23 @ X22 )
=> ( in @ X23 @ X21 ) ) )
=> ( ! [X24: $i,X25: $i] :
( ! [X26: $i] :
( ( in @ X26 @ X24 )
=> ( in @ X26 @ X25 ) )
=> ( subset @ X24 @ X25 ) )
=> ( ! [X27: $i,X28: $i,X29: $i] :
( ( subset @ X27 @ X28 )
=> ( ( in @ X29 @ X27 )
=> ( in @ X29 @ X28 ) ) )
=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( subset @ ( powerset @ X1 ) @ ( powerset @ X2 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[powersetsubset]),powersetI]),powersetE]),subsetI2]),subsetE]) ).
thf(c_0_6,negated_conjecture,
! [X30: $i,X31: $i,X33: $i,X34: $i,X35: $i,X36: $i,X37: $i,X39: $i,X40: $i,X41: $i] :
( ( ( 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 @ ( esk2_2 @ X36 @ X37 ) @ X36 )
| ( subset @ X36 @ X37 ) )
& ( ~ ( in @ ( esk2_2 @ X36 @ X37 ) @ X37 )
| ( subset @ X36 @ X37 ) )
& ( ~ ( subset @ X39 @ X40 )
| ~ ( in @ X41 @ X39 )
| ( in @ X41 @ X40 ) )
& ( subset @ esk3_0 @ esk4_0 )
& ~ ( subset @ ( powerset @ esk3_0 ) @ ( powerset @ esk4_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_5])])])])])]) ).
thf(c_0_7,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_6]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk2_2 @ X1 @ X2 ) @ X1 )
| ( subset @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( in @ X3 @ X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( in @ X3 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
subset @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ ( powerset @ X1 ) @ X2 )
| ( in @ X3 @ X1 )
| ~ ( in @ X3 @ ( esk2_2 @ ( powerset @ X1 ) @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_2 @ X1 @ X2 ) @ X2 )
| ( in @ X2 @ ( powerset @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( in @ X1 @ esk4_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( esk1_2 @ X1 @ ( esk2_2 @ ( powerset @ X2 ) @ X3 ) ) @ X2 )
| ( in @ ( esk2_2 @ ( powerset @ X2 ) @ X3 ) @ ( powerset @ X1 ) )
| ( subset @ ( powerset @ X2 ) @ X3 ) ),
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_6]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( esk1_2 @ X1 @ ( esk2_2 @ ( powerset @ esk3_0 ) @ X2 ) ) @ esk4_0 )
| ( in @ ( esk2_2 @ ( powerset @ esk3_0 ) @ X2 ) @ ( powerset @ X1 ) )
| ( subset @ ( powerset @ esk3_0 ) @ X2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ ( esk2_2 @ X1 @ X2 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk2_2 @ ( powerset @ esk3_0 ) @ X1 ) @ ( powerset @ esk4_0 ) )
| ( subset @ ( powerset @ esk3_0 ) @ X1 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_19,negated_conjecture,
~ ( subset @ ( powerset @ esk3_0 ) @ ( powerset @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU579^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 17:47:37 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 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.18/0.47 # Version: 3.1.0-ho
% 0.18/0.47 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.47 # Starting post_as_ho8 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho3 with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.47 # lpo6_lambda_fix with pid 17222 completed with status 0
% 0.18/0.47 # Result found by lpo6_lambda_fix
% 0.18/0.47 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting new_ho_10 with 811s (1) cores
% 0.18/0.47 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.47 # Starting new_bool_2 with 136s (1) cores
% 0.18/0.47 # Starting new_bool_9 with 136s (1) cores
% 0.18/0.47 # lpo6_lambda_fix with pid 17228 completed with status 0
% 0.18/0.47 # Result found by lpo6_lambda_fix
% 0.18/0.47 # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: HGUNF-FFSF21-SFFFMFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting new_ho_10 with 811s (1) cores
% 0.18/0.47 # Starting lpo6_lambda_fix with 151s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 12
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 15
% 0.18/0.47 # Removed in clause preprocessing : 7
% 0.18/0.47 # Initial clauses in saturation : 8
% 0.18/0.47 # Processed clauses : 31
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 5
% 0.18/0.47 # ...remaining for further processing : 26
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 43
% 0.18/0.47 # ...of the previous two non-redundant : 39
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 43
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 1
% 0.18/0.47 # ...of those cached : 0
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 26
% 0.18/0.47 # Positive orientable unit clauses : 4
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 1
% 0.18/0.47 # Non-unit-clauses : 21
% 0.18/0.47 # Current number of unprocessed clauses: 15
% 0.18/0.47 # ...number of literals in the above : 57
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 0
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 98
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 66
% 0.18/0.47 # Non-unit clause-clause subsumptions : 5
% 0.18/0.47 # Unit Clause-clause subsumption calls : 5
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 7
% 0.18/0.47 # BW rewrite match successes : 0
% 0.18/0.47 # Condensation attempts : 31
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 1986
% 0.18/0.47 # Search garbage collected termcells : 388
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.005 s
% 0.18/0.47 # System time : 0.003 s
% 0.18/0.47 # Total time : 0.008 s
% 0.18/0.47 # Maximum resident set size: 1808 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.022 s
% 0.18/0.47 # System time : 0.012 s
% 0.18/0.47 # Total time : 0.034 s
% 0.18/0.47 # Maximum resident set size: 1700 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------