%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU586^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:22 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 111
% Syntax : Number of formulae : 118 ( 4 unt; 107 typ; 0 def)
% Number of atoms : 345 ( 0 equ; 0 cnn)
% Maximal formula atoms : 114 ( 31 avg)
% Number of connectives : 480 ( 16 ~; 18 |; 107 &; 116 @)
% ( 3 <=>; 220 =>; 0 <=; 0 <~>)
% Maximal formula depth : 123 ( 36 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 108 ( 107 usr; 106 con; 0-2 aty)
% Number of variables : 39 ( 0 ^ 39 !; 0 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $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,
exuI2: $o ).
thf(decl_97,type,
inCongP: $o ).
thf(decl_98,type,
in__Cong: $o ).
thf(decl_99,type,
exuE3u: $o ).
thf(decl_100,type,
exu__Cong: $o ).
thf(decl_101,type,
emptyset__Cong: $o ).
thf(decl_102,type,
setadjoin__Cong: $o ).
thf(decl_103,type,
powerset__Cong: $o ).
thf(decl_104,type,
setunion__Cong: $o ).
thf(decl_105,type,
omega__Cong: $o ).
thf(decl_106,type,
exuEu: $o ).
thf(decl_107,type,
descr__Cong: $o ).
thf(decl_108,type,
dsetconstr__Cong: $o ).
thf(decl_112,type,
subsetI1: $o ).
thf(decl_113,type,
eqimpsubset2: $o ).
thf(decl_114,type,
eqimpsubset1: $o ).
thf(decl_115,type,
subsetI2: $o ).
thf(decl_116,type,
emptysetsubset: $o ).
thf(decl_117,type,
subsetE: $o ).
thf(decl_118,type,
subsetE2: $o ).
thf(decl_119,type,
notsubsetI: $o ).
thf(decl_120,type,
notequalI1: $o ).
thf(decl_121,type,
notequalI2: $o ).
thf(decl_122,type,
subsetRefl: $o ).
thf(decl_123,type,
subsetTrans: $o ).
thf(decl_124,type,
setadjoinSub: $o ).
thf(decl_125,type,
setadjoinSub2: $o ).
thf(decl_126,type,
subset2powerset: $o ).
thf(decl_127,type,
setextsub: $o ).
thf(decl_128,type,
subsetemptysetimpeq: $o ).
thf(decl_129,type,
powersetI1: $o ).
thf(decl_130,type,
powersetE1: $o ).
thf(decl_131,type,
inPowerset: $o ).
thf(decl_132,type,
powersetsubset: $o ).
thf(decl_133,type,
sepInPowerset: $o ).
thf(decl_134,type,
sepSubset: $o ).
thf(decl_135,type,
binunion: $i > $i > $i ).
thf(decl_136,type,
binunionIL: $o ).
thf(decl_137,type,
upairset2IR: $o ).
thf(decl_138,type,
binunionIR: $o ).
thf(decl_139,type,
binunionEcases: $o ).
thf(decl_140,type,
esk1_0: $i ).
thf(decl_141,type,
esk2_0: $i ).
thf(decl_142,type,
esk3_0: $i ).
thf(binunionE,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
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( binunionIL
=> ( upairset2IR
=> ( binunionIR
=> ( binunionEcases
=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ ( binunion @ X4 @ X5 ) )
=> ( ( in @ X2 @ X4 )
| ( in @ X2 @ X5 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionE) ).
thf(binunionIL,axiom,
( binunionIL
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ X4 )
=> ( in @ X2 @ ( binunion @ X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).
thf(binunionEcases,axiom,
( binunionEcases
<=> ! [X4: $i,X5: $i,X2: $i,X19: $o] :
( ( in @ X2 @ ( binunion @ X4 @ X5 ) )
=> ( ( ( in @ X2 @ X4 )
=> X19 )
=> ( ( ( in @ X2 @ X5 )
=> X19 )
=> X19 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionEcases) ).
thf(binunionIR,axiom,
( binunionIR
<=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ X5 )
=> ( in @ X2 @ ( binunion @ X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIR) ).
thf(c_0_4,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
=> ( exuI2
=> ( inCongP
=> ( in__Cong
=> ( exuE3u
=> ( exu__Cong
=> ( emptyset__Cong
=> ( setadjoin__Cong
=> ( powerset__Cong
=> ( setunion__Cong
=> ( omega__Cong
=> ( exuEu
=> ( descr__Cong
=> ( dsetconstr__Cong
=> ( subsetI1
=> ( eqimpsubset2
=> ( eqimpsubset1
=> ( subsetI2
=> ( emptysetsubset
=> ( subsetE
=> ( subsetE2
=> ( notsubsetI
=> ( notequalI1
=> ( notequalI2
=> ( subsetRefl
=> ( subsetTrans
=> ( setadjoinSub
=> ( setadjoinSub2
=> ( subset2powerset
=> ( setextsub
=> ( subsetemptysetimpeq
=> ( powersetI1
=> ( powersetE1
=> ( inPowerset
=> ( powersetsubset
=> ( sepInPowerset
=> ( sepSubset
=> ( ! [X33: $i,X34: $i,X35: $i] :
( ( in @ X35 @ X33 )
=> ( in @ X35 @ ( binunion @ X33 @ X34 ) ) )
=> ( upairset2IR
=> ( ! [X36: $i,X37: $i,X38: $i] :
( ( in @ X38 @ X37 )
=> ( in @ X38 @ ( binunion @ X36 @ X37 ) ) )
=> ( ! [X39: $i,X40: $i,X41: $i,X42: $o] :
( ( in @ X41 @ ( binunion @ X39 @ X40 ) )
=> ( ( ( in @ X41 @ X39 )
=> X42 )
=> ( ( ( in @ X41 @ X40 )
=> X42 )
=> X42 ) ) )
=> ! [X4: $i,X5: $i,X2: $i] :
( ( in @ X2 @ ( binunion @ X4 @ X5 ) )
=> ( ( in @ X2 @ X4 )
| ( in @ X2 @ X5 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[binunionE]),binunionIL]),binunionEcases]),binunionIR]) ).
thf(c_0_5,negated_conjecture,
! [X43: $i,X44: $i,X45: $i,X46: $i,X47: $i,X48: $i,X49: $i,X50: $i,X51: $i,X52: $o] :
( 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
& exuI2
& inCongP
& in__Cong
& exuE3u
& exu__Cong
& emptyset__Cong
& setadjoin__Cong
& powerset__Cong
& setunion__Cong
& omega__Cong
& exuEu
& descr__Cong
& dsetconstr__Cong
& subsetI1
& eqimpsubset2
& eqimpsubset1
& subsetI2
& emptysetsubset
& subsetE
& subsetE2
& notsubsetI
& notequalI1
& notequalI2
& subsetRefl
& subsetTrans
& setadjoinSub
& setadjoinSub2
& subset2powerset
& setextsub
& subsetemptysetimpeq
& powersetI1
& powersetE1
& inPowerset
& powersetsubset
& sepInPowerset
& sepSubset
& ( ~ ( in @ X45 @ X43 )
| ( in @ X45 @ ( binunion @ X43 @ X44 ) ) )
& upairset2IR
& ( ~ ( in @ X48 @ X47 )
| ( in @ X48 @ ( binunion @ X46 @ X47 ) ) )
& ( ( in @ X51 @ X50 )
| X52
| ( in @ X51 @ X49 )
| ~ ( in @ X51 @ ( binunion @ X49 @ X50 ) ) )
& ( ~ X52
| X52
| ( in @ X51 @ X49 )
| ~ ( in @ X51 @ ( binunion @ X49 @ X50 ) ) )
& ( ( in @ X51 @ X50 )
| X52
| ~ X52
| ~ ( in @ X51 @ ( binunion @ X49 @ X50 ) ) )
& ( ~ X52
| X52
| ~ X52
| ~ ( in @ X51 @ ( binunion @ X49 @ X50 ) ) )
& ( in @ esk3_0 @ ( binunion @ esk1_0 @ esk2_0 ) )
& ~ ( in @ esk3_0 @ esk1_0 )
& ~ ( in @ esk3_0 @ 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,
! [X2: $i,X4: $i,X3: $i] :
( ( in @ X2 @ X3 )
| ( in @ X2 @ X4 )
| ~ ( in @ X2 @ ( binunion @ X4 @ X3 ) ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])]) ).
thf(c_0_7,negated_conjecture,
in @ esk3_0 @ ( binunion @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
~ ( in @ esk3_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
~ ( in @ esk3_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU586^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n027.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 15:59:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.49 # Version: 3.1.0-ho
% 0.19/0.49 # Preprocessing class: HSLMSLSSLLLCHFA.
% 0.19/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best5 with 300s (1) cores
% 0.19/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.19/0.49 # Starting new_bool_5 with 300s (1) cores
% 0.19/0.49 # Starting pre_casc_3 with 300s (1) cores
% 0.19/0.49 # Starting ho_unfolding_8 with 300s (1) cores
% 0.19/0.49 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_ho_5 with 300s (1) cores
% 0.19/0.49 # pre_casc_3 with pid 14599 completed with status 0
% 0.19/0.49 # Result found by pre_casc_3
% 0.19/0.49 # Preprocessing class: HSLMSLSSLLLCHFA.
% 0.19/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best5 with 300s (1) cores
% 0.19/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.19/0.49 # Starting new_bool_5 with 300s (1) cores
% 0.19/0.49 # Starting pre_casc_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,10,,5,20000,3.0,true)
% 0.19/0.49 # Search class: HGUNF-FFSM22-SHFMMFNN
% 0.19/0.49 # partial match(3): HGUNF-FFSF22-SFFFMFNN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # new_ho_10 with pid 14605 completed with status 0
% 0.19/0.49 # Result found by new_ho_10
% 0.19/0.49 # Preprocessing class: HSLMSLSSLLLCHFA.
% 0.19/0.49 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting ehoh_best5 with 300s (1) cores
% 0.19/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.19/0.49 # Starting new_bool_5 with 300s (1) cores
% 0.19/0.49 # Starting pre_casc_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,10,,5,20000,3.0,true)
% 0.19/0.49 # Search class: HGUNF-FFSM22-SHFMMFNN
% 0.19/0.49 # partial match(3): HGUNF-FFSF22-SFFFMFNN
% 0.19/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.49 # Preprocessing time : 0.002 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 223
% 0.19/0.49 # Removed by relevancy pruning/SinE : 219
% 0.19/0.49 # Initial clauses : 108
% 0.19/0.49 # Removed in clause preprocessing : 3
% 0.19/0.49 # Initial clauses in saturation : 105
% 0.19/0.49 # Processed clauses : 210
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 210
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 0
% 0.19/0.49 # Generated clauses : 3
% 0.19/0.49 # ...of the previous two non-redundant : 0
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 3
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 0
% 0.19/0.49 # ...of those cached : 0
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 105
% 0.19/0.49 # Positive orientable unit clauses : 100
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 3
% 0.19/0.49 # Current number of unprocessed clauses: 0
% 0.19/0.49 # ...number of literals in the above : 0
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 105
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 6
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 6
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 0
% 0.19/0.49 # BW rewrite match successes : 0
% 0.19/0.49 # Condensation attempts : 210
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 5947
% 0.19/0.49 # Search garbage collected termcells : 2398
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.006 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.012 s
% 0.19/0.49 # Maximum resident set size: 2624 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.013 s
% 0.19/0.49 # System time : 0.007 s
% 0.19/0.49 # Total time : 0.020 s
% 0.19/0.49 # Maximum resident set size: 1948 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------