TSTP Solution File: SEU819^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU819^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:30:33 EDT 2024
% Result : Theorem 0.37s 0.53s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 37 ( 12 unt; 15 typ; 0 def)
% Number of atoms : 131 ( 14 equ; 0 cnn)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 365 ( 26 ~; 33 |; 22 &; 246 @)
% ( 1 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 7 ^ 47 !; 5 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_24,type,
powerset: $i > $i ).
thf(decl_25,type,
setunion: $i > $i ).
thf(decl_26,type,
nonempty: $i > $o ).
thf(decl_27,type,
subset: $i > $i > $o ).
thf(decl_28,type,
transitiveset: $i > $o ).
thf(decl_29,type,
setunionTransitive: $o ).
thf(decl_30,type,
stricttotalorderedByIn: $i > $o ).
thf(decl_31,type,
wellorderedByIn: $i > $o ).
thf(decl_32,type,
ordinal: $i > $o ).
thf(decl_33,type,
esk1_1: $i > $i ).
thf(decl_34,type,
esk2_1: $i > $i ).
thf(decl_35,type,
esk3_0: $i ).
thf(decl_36,type,
esk4_2: $i > $i > $i ).
thf(decl_37,type,
esk5_0: $i ).
thf(ordinal,axiom,
( ordinal
= ( ^ [X1: $i] :
( ( transitiveset @ X1 )
& ( wellorderedByIn @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordinal) ).
thf(transitiveset,axiom,
( transitiveset
= ( ^ [X2: $i] :
! [X3: $i] :
( ( in @ X3 @ X2 )
=> ( subset @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitiveset) ).
thf(wellorderedByIn,axiom,
( wellorderedByIn
= ( ^ [X2: $i] :
( ( stricttotalorderedByIn @ X2 )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ X2 ) )
=> ( ( nonempty @ X3 )
=> ? [X1: $i] :
( ( in @ X1 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X1 = X4 )
| ( in @ X1 @ X4 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wellorderedByIn) ).
thf(setunionTransitive,axiom,
( setunionTransitive
<=> ! [X3: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ( transitiveset @ X1 ) )
=> ( transitiveset @ ( setunion @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionTransitive) ).
thf(setunionOrdinalLem1,conjecture,
( setunionTransitive
=> ! [X3: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ( ordinal @ X1 ) )
=> ( transitiveset @ ( setunion @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',setunionOrdinalLem1) ).
thf(c_0_5,plain,
( ordinal
= ( ^ [Z0: $i] :
( ! [X11: $i] :
( ( in @ X11 @ Z0 )
=> ( subset @ X11 @ Z0 ) )
& ( stricttotalorderedByIn @ Z0 )
& ! [X12: $i] :
( ( in @ X12 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X12 )
=> ? [X13: $i] :
( ( in @ X13 @ X12 )
& ! [X14: $i] :
( ( in @ X14 @ X12 )
=> ( ( X13 = X14 )
| ( in @ X13 @ X14 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ordinal]) ).
thf(c_0_6,plain,
( transitiveset
= ( ^ [Z0: $i] :
! [X3: $i] :
( ( in @ X3 @ Z0 )
=> ( subset @ X3 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[transitiveset]) ).
thf(c_0_7,plain,
( wellorderedByIn
= ( ^ [Z0: $i] :
( ( stricttotalorderedByIn @ Z0 )
& ! [X3: $i] :
( ( in @ X3 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X3 )
=> ? [X1: $i] :
( ( in @ X1 @ X3 )
& ! [X4: $i] :
( ( in @ X4 @ X3 )
=> ( ( X1 = X4 )
| ( in @ X1 @ X4 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[wellorderedByIn]) ).
thf(c_0_8,plain,
( ordinal
= ( ^ [Z0: $i] :
( ! [X11: $i] :
( ( in @ X11 @ Z0 )
=> ( subset @ X11 @ Z0 ) )
& ( stricttotalorderedByIn @ Z0 )
& ! [X12: $i] :
( ( in @ X12 @ ( powerset @ Z0 ) )
=> ( ( nonempty @ X12 )
=> ? [X13: $i] :
( ( in @ X13 @ X12 )
& ! [X14: $i] :
( ( in @ X14 @ X12 )
=> ( ( X13 = X14 )
| ( in @ X13 @ X14 ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
thf(c_0_9,axiom,
( setunionTransitive
= ( ! [X3: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ! [X9: $i] :
( ( in @ X9 @ X1 )
=> ( subset @ X9 @ X1 ) ) )
=> ! [X10: $i] :
( ( in @ X10 @ ( setunion @ X3 ) )
=> ( subset @ X10 @ ( setunion @ X3 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[setunionTransitive,c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( ! [X15: $i] :
( ! [X16: $i] :
( ( in @ X16 @ X15 )
=> ! [X17: $i] :
( ( in @ X17 @ X16 )
=> ( subset @ X17 @ X16 ) ) )
=> ! [X18: $i] :
( ( in @ X18 @ ( setunion @ X15 ) )
=> ( subset @ X18 @ ( setunion @ X15 ) ) ) )
=> ! [X3: $i] :
( ! [X1: $i] :
( ( in @ X1 @ X3 )
=> ( ! [X19: $i] :
( ( in @ X19 @ X1 )
=> ( subset @ X19 @ X1 ) )
& ( stricttotalorderedByIn @ X1 )
& ! [X20: $i] :
( ( in @ X20 @ ( powerset @ X1 ) )
=> ( ( nonempty @ X20 )
=> ? [X21: $i] :
( ( in @ X21 @ X20 )
& ! [X22: $i] :
( ( in @ X22 @ X20 )
=> ( ( X21 = X22 )
| ( in @ X21 @ X22 ) ) ) ) ) ) ) )
=> ! [X23: $i] :
( ( in @ X23 @ ( setunion @ X3 ) )
=> ( subset @ X23 @ ( setunion @ X3 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setunionOrdinalLem1]),c_0_6]),c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X24: $i,X27: $i,X29: $i,X30: $i,X31: $i,X33: $i] :
( ( ( in @ ( esk1_1 @ X24 ) @ X24 )
| ~ ( in @ X27 @ ( setunion @ X24 ) )
| ( subset @ X27 @ ( setunion @ X24 ) ) )
& ( ( in @ ( esk2_1 @ X24 ) @ ( esk1_1 @ X24 ) )
| ~ ( in @ X27 @ ( setunion @ X24 ) )
| ( subset @ X27 @ ( setunion @ X24 ) ) )
& ( ~ ( subset @ ( esk2_1 @ X24 ) @ ( esk1_1 @ X24 ) )
| ~ ( in @ X27 @ ( setunion @ X24 ) )
| ( subset @ X27 @ ( setunion @ X24 ) ) )
& ( ~ ( in @ X30 @ X29 )
| ( subset @ X30 @ X29 )
| ~ ( in @ X29 @ esk3_0 ) )
& ( ( stricttotalorderedByIn @ X29 )
| ~ ( in @ X29 @ esk3_0 ) )
& ( ( in @ ( esk4_2 @ X29 @ X31 ) @ X31 )
| ~ ( nonempty @ X31 )
| ~ ( in @ X31 @ ( powerset @ X29 ) )
| ~ ( in @ X29 @ esk3_0 ) )
& ( ~ ( in @ X33 @ X31 )
| ( ( esk4_2 @ X29 @ X31 )
= X33 )
| ( in @ ( esk4_2 @ X29 @ X31 ) @ X33 )
| ~ ( nonempty @ X31 )
| ~ ( in @ X31 @ ( powerset @ X29 ) )
| ~ ( in @ X29 @ esk3_0 ) )
& ( in @ esk5_0 @ ( setunion @ esk3_0 ) )
& ~ ( subset @ esk5_0 @ ( setunion @ esk3_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_10])])])])])]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i,X1: $i] :
( ( subset @ X2 @ ( setunion @ X1 ) )
| ~ ( subset @ ( esk2_1 @ X1 ) @ ( esk1_1 @ X1 ) )
| ~ ( in @ X2 @ ( setunion @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
| ~ ( in @ X1 @ X2 )
| ~ ( in @ X2 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_14,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk2_1 @ X1 ) @ ( esk1_1 @ X1 ) )
| ( subset @ X2 @ ( setunion @ X1 ) )
| ~ ( in @ X2 @ ( setunion @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i,X1: $i] :
( ( in @ ( esk1_1 @ X1 ) @ X1 )
| ( subset @ X2 @ ( setunion @ X1 ) )
| ~ ( in @ X2 @ ( setunion @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,negated_conjecture,
in @ esk5_0 @ ( setunion @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,negated_conjecture,
~ ( subset @ esk5_0 @ ( setunion @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i] :
( ( subset @ X1 @ ( setunion @ X2 ) )
| ~ ( in @ ( esk1_1 @ X2 ) @ esk3_0 )
| ~ ( in @ X1 @ ( setunion @ X2 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_19,negated_conjecture,
in @ ( esk1_1 @ esk3_0 ) @ esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ ( setunion @ esk3_0 ) )
| ~ ( in @ X1 @ ( setunion @ esk3_0 ) ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU819^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 16:24:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.52 Running higher-order theorem proving
% 0.21/0.52 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.37/0.53 # Version: 3.1.0-ho
% 0.37/0.53 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.37/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.53 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.37/0.53 # Starting post_as_ho5 with 300s (1) cores
% 0.37/0.53 # Starting sh4l with 300s (1) cores
% 0.37/0.53 # Starting ho_unfolding_2 with 300s (1) cores
% 0.37/0.53 # post_as_ho5 with pid 20400 completed with status 0
% 0.37/0.53 # Result found by post_as_ho5
% 0.37/0.53 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.37/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.53 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.37/0.53 # Starting post_as_ho5 with 300s (1) cores
% 0.37/0.53 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.37/0.53 # Search class: HGUSF-FFSF21-SSFFMFNN
% 0.37/0.53 # partial match(1): HGUSF-FFSF22-SSFFMFNN
% 0.37/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.37/0.53 # new_ho_10 with pid 20403 completed with status 0
% 0.37/0.53 # Result found by new_ho_10
% 0.37/0.53 # Preprocessing class: HSSSSMSSSLSNSFN.
% 0.37/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.53 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.37/0.53 # Starting post_as_ho5 with 300s (1) cores
% 0.37/0.53 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.37/0.53 # Search class: HGUSF-FFSF21-SSFFMFNN
% 0.37/0.53 # partial match(1): HGUSF-FFSF22-SSFFMFNN
% 0.37/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.37/0.53 # Preprocessing time : 0.001 s
% 0.37/0.53 # Presaturation interreduction done
% 0.37/0.53
% 0.37/0.53 # Proof found!
% 0.37/0.53 # SZS status Theorem
% 0.37/0.53 # SZS output start CNFRefutation
% See solution above
% 0.37/0.53 # Parsed axioms : 18
% 0.37/0.53 # Removed by relevancy pruning/SinE : 13
% 0.37/0.53 # Initial clauses : 9
% 0.37/0.53 # Removed in clause preprocessing : 0
% 0.37/0.53 # Initial clauses in saturation : 9
% 0.37/0.53 # Processed clauses : 23
% 0.37/0.53 # ...of these trivial : 0
% 0.37/0.53 # ...subsumed : 0
% 0.37/0.53 # ...remaining for further processing : 23
% 0.37/0.53 # Other redundant clauses eliminated : 0
% 0.37/0.53 # Clauses deleted for lack of memory : 0
% 0.37/0.53 # Backward-subsumed : 0
% 0.37/0.53 # Backward-rewritten : 0
% 0.37/0.53 # Generated clauses : 10
% 0.37/0.53 # ...of the previous two non-redundant : 9
% 0.37/0.53 # ...aggressively subsumed : 0
% 0.37/0.53 # Contextual simplify-reflections : 1
% 0.37/0.53 # Paramodulations : 10
% 0.37/0.53 # Factorizations : 0
% 0.37/0.53 # NegExts : 0
% 0.37/0.53 # Equation resolutions : 0
% 0.37/0.53 # Disequality decompositions : 0
% 0.37/0.53 # Total rewrite steps : 2
% 0.37/0.53 # ...of those cached : 1
% 0.37/0.53 # Propositional unsat checks : 0
% 0.37/0.53 # Propositional check models : 0
% 0.37/0.53 # Propositional check unsatisfiable : 0
% 0.37/0.53 # Propositional clauses : 0
% 0.37/0.53 # Propositional clauses after purity: 0
% 0.37/0.53 # Propositional unsat core size : 0
% 0.37/0.53 # Propositional preprocessing time : 0.000
% 0.37/0.53 # Propositional encoding time : 0.000
% 0.37/0.53 # Propositional solver time : 0.000
% 0.37/0.53 # Success case prop preproc time : 0.000
% 0.37/0.53 # Success case prop encoding time : 0.000
% 0.37/0.53 # Success case prop solver time : 0.000
% 0.37/0.53 # Current number of processed clauses : 14
% 0.37/0.53 # Positive orientable unit clauses : 3
% 0.37/0.53 # Positive unorientable unit clauses: 0
% 0.37/0.53 # Negative unit clauses : 2
% 0.37/0.53 # Non-unit-clauses : 9
% 0.37/0.53 # Current number of unprocessed clauses: 4
% 0.37/0.53 # ...number of literals in the above : 24
% 0.37/0.53 # Current number of archived formulas : 0
% 0.37/0.53 # Current number of archived clauses : 9
% 0.37/0.53 # Clause-clause subsumption calls (NU) : 20
% 0.37/0.53 # Rec. Clause-clause subsumption calls : 10
% 0.37/0.53 # Non-unit clause-clause subsumptions : 1
% 0.37/0.53 # Unit Clause-clause subsumption calls : 0
% 0.37/0.53 # Rewrite failures with RHS unbound : 0
% 0.37/0.53 # BW rewrite match attempts : 0
% 0.37/0.53 # BW rewrite match successes : 0
% 0.37/0.53 # Condensation attempts : 23
% 0.37/0.53 # Condensation successes : 0
% 0.37/0.53 # Termbank termtop insertions : 1713
% 0.37/0.53 # Search garbage collected termcells : 474
% 0.37/0.53
% 0.37/0.53 # -------------------------------------------------
% 0.37/0.53 # User time : 0.004 s
% 0.37/0.53 # System time : 0.002 s
% 0.37/0.53 # Total time : 0.006 s
% 0.37/0.53 # Maximum resident set size: 1904 pages
% 0.37/0.53
% 0.37/0.53 # -------------------------------------------------
% 0.37/0.53 # User time : 0.006 s
% 0.37/0.53 # System time : 0.004 s
% 0.37/0.53 # Total time : 0.010 s
% 0.37/0.53 # Maximum resident set size: 1712 pages
% 0.37/0.53 % E---3.1 exiting
% 0.37/0.53 % E exiting
%------------------------------------------------------------------------------