TSTP Solution File: SEU546^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU546^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:05 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 68
% Syntax : Number of formulae : 78 ( 4 unt; 66 typ; 0 def)
% Number of atoms : 216 ( 14 equ; 0 cnn)
% Maximal formula atoms : 70 ( 18 avg)
% Number of connectives : 247 ( 12 ~; 9 |; 68 &; 27 @)
% ( 2 <=>; 129 =>; 0 <=; 0 <~>)
% Maximal formula depth : 71 ( 20 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 68 ( 66 usr; 64 con; 0-2 aty)
% Number of variables : 22 ( 3 ^ 14 !; 5 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
exu: ( $i > $o ) > $o ).
thf(decl_24,type,
setextAx: $o ).
thf(decl_26,type,
emptysetAx: $o ).
thf(decl_28,type,
setadjoinAx: $o ).
thf(decl_30,type,
powersetAx: $o ).
thf(decl_32,type,
setunionAx: $o ).
thf(decl_34,type,
omega0Ax: $o ).
thf(decl_35,type,
omegaSAx: $o ).
thf(decl_36,type,
omegaIndAx: $o ).
thf(decl_37,type,
replAx: $o ).
thf(decl_38,type,
foundationAx: $o ).
thf(decl_39,type,
wellorderingAx: $o ).
thf(decl_41,type,
descrp: $o ).
thf(decl_43,type,
dsetconstrI: $o ).
thf(decl_44,type,
dsetconstrEL: $o ).
thf(decl_45,type,
dsetconstrER: $o ).
thf(decl_46,type,
exuE1: $o ).
thf(decl_48,type,
prop2setE: $o ).
thf(decl_49,type,
emptysetE: $o ).
thf(decl_50,type,
emptysetimpfalse: $o ).
thf(decl_51,type,
notinemptyset: $o ).
thf(decl_52,type,
exuE3e: $o ).
thf(decl_53,type,
setext: $o ).
thf(decl_54,type,
emptyI: $o ).
thf(decl_55,type,
noeltsimpempty: $o ).
thf(decl_56,type,
setbeta: $o ).
thf(decl_58,type,
nonemptyE1: $o ).
thf(decl_59,type,
nonemptyI: $o ).
thf(decl_60,type,
nonemptyI1: $o ).
thf(decl_61,type,
setadjoinIL: $o ).
thf(decl_62,type,
emptyinunitempty: $o ).
thf(decl_63,type,
setadjoinIR: $o ).
thf(decl_64,type,
setadjoinE: $o ).
thf(decl_65,type,
setadjoinOr: $o ).
thf(decl_66,type,
setoftrueEq: $o ).
thf(decl_67,type,
powersetI: $o ).
thf(decl_68,type,
emptyinPowerset: $o ).
thf(decl_69,type,
emptyInPowerset: $o ).
thf(decl_70,type,
powersetE: $o ).
thf(decl_71,type,
setunionI: $o ).
thf(decl_72,type,
setunionE: $o ).
thf(decl_73,type,
subPowSU: $o ).
thf(decl_74,type,
exuE2: $o ).
thf(decl_75,type,
nonemptyImpWitness: $o ).
thf(decl_76,type,
uniqinunit: $o ).
thf(decl_77,type,
notinsingleton: $o ).
thf(decl_78,type,
eqinunit: $o ).
thf(decl_79,type,
singletonsswitch: $o ).
thf(decl_80,type,
upairsetE: $o ).
thf(decl_81,type,
upairsetIL: $o ).
thf(decl_82,type,
upairsetIR: $o ).
thf(decl_83,type,
emptyE1: $o ).
thf(decl_84,type,
vacuousDall: $o ).
thf(decl_85,type,
quantDeMorgan1: $o ).
thf(decl_86,type,
quantDeMorgan2: $o ).
thf(decl_87,type,
quantDeMorgan3: $o ).
thf(decl_88,type,
quantDeMorgan4: $o ).
thf(decl_89,type,
prop2setI: $o ).
thf(decl_91,type,
prop2set2propI: $o ).
thf(decl_92,type,
notdexE: $o ).
thf(decl_93,type,
notdallE: $o ).
thf(decl_94,type,
exuI1: $o ).
thf(decl_95,type,
exuI3: $o ).
thf(decl_96,type,
epred1_0: $i > $o ).
thf(decl_97,type,
esk1_0: $i ).
thf(decl_98,type,
esk2_1: $i > $i ).
thf(exu,axiom,
( exu
= ( ^ [X1: $i > $o] :
? [X2: $i] :
( ( X1 @ X2 )
& ! [X3: $i] :
( ( X1 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exu) ).
thf(exuI2,conjecture,
( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ! [X1: $i > $o] :
( ? [X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X3 = X2 ) )
=> ( exu
@ ^ [X2: $i] : ( X1 @ X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exuI2) ).
thf(c_0_2,plain,
( exu
= ( ^ [Z0: $i > $o] :
? [X2: $i] :
( ( Z0 @ X2 )
& ! [X3: $i] :
( ( Z0 @ X3 )
=> ( X2 = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[exu]) ).
thf(c_0_3,negated_conjecture,
~ ( setextAx
=> ( emptysetAx
=> ( setadjoinAx
=> ( powersetAx
=> ( setunionAx
=> ( omega0Ax
=> ( omegaSAx
=> ( omegaIndAx
=> ( replAx
=> ( foundationAx
=> ( wellorderingAx
=> ( descrp
=> ( dsetconstrI
=> ( dsetconstrEL
=> ( dsetconstrER
=> ( exuE1
=> ( prop2setE
=> ( emptysetE
=> ( emptysetimpfalse
=> ( notinemptyset
=> ( exuE3e
=> ( setext
=> ( emptyI
=> ( noeltsimpempty
=> ( setbeta
=> ( nonemptyE1
=> ( nonemptyI
=> ( nonemptyI1
=> ( setadjoinIL
=> ( emptyinunitempty
=> ( setadjoinIR
=> ( setadjoinE
=> ( setadjoinOr
=> ( setoftrueEq
=> ( powersetI
=> ( emptyinPowerset
=> ( emptyInPowerset
=> ( powersetE
=> ( setunionI
=> ( setunionE
=> ( subPowSU
=> ( exuE2
=> ( nonemptyImpWitness
=> ( uniqinunit
=> ( notinsingleton
=> ( eqinunit
=> ( singletonsswitch
=> ( upairsetE
=> ( upairsetIL
=> ( upairsetIR
=> ( emptyE1
=> ( vacuousDall
=> ( quantDeMorgan1
=> ( quantDeMorgan2
=> ( quantDeMorgan3
=> ( quantDeMorgan4
=> ( prop2setI
=> ( prop2set2propI
=> ( notdexE
=> ( notdallE
=> ( exuI1
=> ( exuI3
=> ! [X1: $i > $o] :
( ? [X2: $i] :
! [X3: $i] :
( ( X1 @ X3 )
<=> ( X3 = X2 ) )
=> ? [X20: $i] :
( ( X1 @ X20 )
& ! [X21: $i] :
( ( X1 @ X21 )
=> ( X20 = X21 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[exuI2])]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X24: $i,X25: $i] :
( setextAx
& emptysetAx
& setadjoinAx
& powersetAx
& setunionAx
& omega0Ax
& omegaSAx
& omegaIndAx
& replAx
& foundationAx
& wellorderingAx
& descrp
& dsetconstrI
& dsetconstrEL
& dsetconstrER
& exuE1
& prop2setE
& emptysetE
& emptysetimpfalse
& notinemptyset
& exuE3e
& setext
& emptyI
& noeltsimpempty
& setbeta
& nonemptyE1
& nonemptyI
& nonemptyI1
& setadjoinIL
& emptyinunitempty
& setadjoinIR
& setadjoinE
& setadjoinOr
& setoftrueEq
& powersetI
& emptyinPowerset
& emptyInPowerset
& powersetE
& setunionI
& setunionE
& subPowSU
& exuE2
& nonemptyImpWitness
& uniqinunit
& notinsingleton
& eqinunit
& singletonsswitch
& upairsetE
& upairsetIL
& upairsetIR
& emptyE1
& vacuousDall
& quantDeMorgan1
& quantDeMorgan2
& quantDeMorgan3
& quantDeMorgan4
& prop2setI
& prop2set2propI
& notdexE
& notdallE
& exuI1
& exuI3
& ( ~ ( epred1_0 @ X24 )
| ( X24 = esk1_0 ) )
& ( ( X24 != esk1_0 )
| ( epred1_0 @ X24 ) )
& ( ( epred1_0 @ ( esk2_1 @ X25 ) )
| ~ ( epred1_0 @ X25 ) )
& ( ( X25
!= ( esk2_1 @ X25 ) )
| ~ ( epred1_0 @ X25 ) ) ),
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,
! [X2: $i] :
( ( X2 = esk1_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ X2 )
| ( X2 != esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X2: $i] :
( ( X2
!= ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] :
( ( ( esk2_1 @ X2 )
= esk1_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk1_0,
inference(er,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9])]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU546^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 17:08:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/0.47 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.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # Preprocessing class: HSMSSLSSLLLCHSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho9 with 300s (1) cores
% 0.21/0.49 # Starting sh2lt with 300s (1) cores
% 0.21/0.49 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.49 # post_as_ho9 with pid 7539 completed with status 0
% 0.21/0.49 # Result found by post_as_ho9
% 0.21/0.49 # Preprocessing class: HSMSSLSSLLLCHSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho9 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.21/0.49 # Search class: HHHSF-FFSM11-SHSMMFNN
% 0.21/0.49 # partial match(2): HHHSF-FFSF11-SHSFMFNN
% 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 7543 completed with status 0
% 0.21/0.49 # Result found by new_ho_10
% 0.21/0.49 # Preprocessing class: HSMSSLSSLLLCHSA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_9 with 1500s (5) cores
% 0.21/0.49 # Starting post_as_ho9 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,,true,1,0,2,20000,1.0,true)
% 0.21/0.49 # Search class: HHHSF-FFSM11-SHSMMFNN
% 0.21/0.49 # partial match(2): HHHSF-FFSF11-SHSFMFNN
% 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.002 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 : 139
% 0.21/0.49 # Removed by relevancy pruning/SinE : 137
% 0.21/0.49 # Initial clauses : 66
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 66
% 0.21/0.49 # Processed clauses : 134
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 134
% 0.21/0.49 # Other redundant clauses eliminated : 2
% 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 : 5
% 0.21/0.49 # ...of the previous two non-redundant : 2
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 3
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 2
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 2
% 0.21/0.49 # ...of those cached : 1
% 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 : 67
% 0.21/0.49 # Positive orientable unit clauses : 63
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 0
% 0.21/0.49 # Non-unit-clauses : 4
% 0.21/0.49 # Current number of unprocessed clauses: 0
% 0.21/0.49 # ...number of literals in the above : 0
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 66
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 7
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 4
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 0
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 0
% 0.21/0.49 # BW rewrite match successes : 0
% 0.21/0.49 # Condensation attempts : 134
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 3798
% 0.21/0.49 # Search garbage collected termcells : 1627
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.007 s
% 0.21/0.49 # System time : 0.001 s
% 0.21/0.49 # Total time : 0.008 s
% 0.21/0.49 # Maximum resident set size: 2188 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.012 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.014 s
% 0.21/0.49 # Maximum resident set size: 1868 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------