TSTP Solution File: NUM518+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM518+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:31 EDT 2023
% Result : Theorem 0.21s 0.64s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 54 ( 20 unt; 0 def)
% Number of atoms : 207 ( 57 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 254 ( 101 ~; 109 |; 31 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn; 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m__) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',mDefQuot) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',mDefPrime) ).
fof(mLETran,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X3) )
=> sdtlseqdt0(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',mLETran) ).
fof(m__2342,hypothesis,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m__2342) ).
fof(mDivLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( doDivides0(X1,X2)
& X2 != sz00 )
=> sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',mDivLE) ).
fof(m__2645,hypothesis,
( doDivides0(xp,sdtsldt0(xn,xr))
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m__2645) ).
fof(m__2504,hypothesis,
( sdtsldt0(xn,xr) != xn
& sdtlseqdt0(sdtsldt0(xn,xr),xn) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m__2504) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m__1837) ).
fof(m__2487,hypothesis,
doDivides0(xr,xn),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m__2487) ).
fof(m__1870,hypothesis,
~ sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m__1870) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',mDefDiv) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sdtasdt0(X1,sz00) = sz00
& sz00 = sdtasdt0(sz00,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',m_MulZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p',mSortsC) ).
fof(c_0_14,negated_conjecture,
~ ( doDivides0(xp,xn)
| doDivides0(xp,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_15,plain,
! [X64,X65,X66] :
( ( aNaturalNumber0(X66)
| X66 != sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) )
& ( X65 = sdtasdt0(X64,X66)
| X66 != sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) )
& ( ~ aNaturalNumber0(X66)
| X65 != sdtasdt0(X64,X66)
| X66 = sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])]) ).
fof(c_0_16,plain,
! [X81,X82] :
( ( X81 != sz00
| ~ isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( X81 != sz10
| ~ isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( ~ aNaturalNumber0(X82)
| ~ doDivides0(X82,X81)
| X82 = sz10
| X82 = X81
| ~ isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( aNaturalNumber0(esk3_1(X81))
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( doDivides0(esk3_1(X81),X81)
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( esk3_1(X81) != sz10
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( esk3_1(X81) != X81
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrime])])])])]) ).
fof(c_0_17,negated_conjecture,
( ~ doDivides0(xp,xn)
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X44,X45,X46] :
( ~ aNaturalNumber0(X44)
| ~ aNaturalNumber0(X45)
| ~ aNaturalNumber0(X46)
| ~ sdtlseqdt0(X44,X45)
| ~ sdtlseqdt0(X45,X46)
| sdtlseqdt0(X44,X46) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLETran])]) ).
cnf(c_0_19,plain,
( aNaturalNumber0(X1)
| X3 = sz00
| X1 != sdtsldt0(X2,X3)
| ~ doDivides0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( X1 != sz00
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_22,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
fof(c_0_23,plain,
! [X76,X77] :
( ~ aNaturalNumber0(X76)
| ~ aNaturalNumber0(X77)
| ~ doDivides0(X76,X77)
| X77 = sz00
| sdtlseqdt0(X76,X77) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivLE])]) ).
cnf(c_0_24,hypothesis,
( doDivides0(xp,sdtsldt0(xn,xr))
| doDivides0(xp,xm) ),
inference(split_conjunct,[status(thm)],[m__2645]) ).
cnf(c_0_25,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( sdtlseqdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,hypothesis,
sdtlseqdt0(sdtsldt0(xn,xr),xn),
inference(split_conjunct,[status(thm)],[m__2504]) ).
cnf(c_0_28,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_29,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_30,hypothesis,
doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[m__2487]) ).
cnf(c_0_31,hypothesis,
xr != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_32,plain,
( X2 = sz00
| sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,hypothesis,
doDivides0(xp,sdtsldt0(xn,xr)),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_35,hypothesis,
( sdtlseqdt0(X1,xn)
| ~ sdtlseqdt0(X1,sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_36,hypothesis,
aNaturalNumber0(sdtsldt0(xn,xr)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]),c_0_28])]),c_0_31]) ).
cnf(c_0_37,hypothesis,
( sdtsldt0(xn,xr) = sz00
| sdtlseqdt0(xp,sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
fof(c_0_38,hypothesis,
~ sdtlseqdt0(xp,xn),
inference(fof_simplification,[status(thm)],[m__1870]) ).
fof(c_0_39,plain,
! [X60,X61,X63] :
( ( aNaturalNumber0(esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( X61 = sdtasdt0(X60,esk2_2(X60,X61))
| ~ doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( ~ aNaturalNumber0(X63)
| X61 != sdtasdt0(X60,X63)
| doDivides0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])]) ).
fof(c_0_40,plain,
! [X20] :
( ( sdtasdt0(X20,sz00) = sz00
| ~ aNaturalNumber0(X20) )
& ( sz00 = sdtasdt0(sz00,X20)
| ~ aNaturalNumber0(X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])]) ).
cnf(c_0_41,hypothesis,
( sdtlseqdt0(X1,xn)
| ~ sdtlseqdt0(X1,sdtsldt0(xn,xr))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_42,hypothesis,
( sdtsldt0(xn,xr) = sz00
| sdtlseqdt0(xp,sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_36])]) ).
cnf(c_0_43,hypothesis,
~ sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
( doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| X2 != sdtasdt0(X3,X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_47,plain,
( X1 = sdtasdt0(X2,X3)
| X2 = sz00
| X3 != sdtsldt0(X1,X2)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_48,hypothesis,
sdtsldt0(xn,xr) = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34])]),c_0_43]) ).
cnf(c_0_49,negated_conjecture,
~ doDivides0(xp,xn),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_50,plain,
( doDivides0(X1,X2)
| X2 != sz00
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_51,hypothesis,
( sdtasdt0(xr,X1) = xn
| X1 != sz00 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_30]),c_0_22]),c_0_28])]),c_0_31]) ).
cnf(c_0_52,negated_conjecture,
xn != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_34]),c_0_28])]) ).
cnf(c_0_53,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_51]),c_0_22])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM518+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 14:18:14 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.HiuLmFCCEE/E---3.1_7451.p
% 0.21/0.64 # Version: 3.1pre001
% 0.21/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.64 # Starting sh5l with 300s (1) cores
% 0.21/0.64 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 7532 completed with status 0
% 0.21/0.64 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.64 # No SInE strategy applied
% 0.21/0.64 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.21/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.64 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.21/0.64 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.64 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.21/0.64 # G-E--_208_C18_F1_AE_CS_SP_PS_S3S with pid 7539 completed with status 0
% 0.21/0.64 # Result found by G-E--_208_C18_F1_AE_CS_SP_PS_S3S
% 0.21/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.64 # No SInE strategy applied
% 0.21/0.64 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.21/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.64 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.21/0.64 # Preprocessing time : 0.002 s
% 0.21/0.64 # Presaturation interreduction done
% 0.21/0.64
% 0.21/0.64 # Proof found!
% 0.21/0.64 # SZS status Theorem
% 0.21/0.64 # SZS output start CNFRefutation
% See solution above
% 0.21/0.64 # Parsed axioms : 56
% 0.21/0.64 # Removed by relevancy pruning/SinE : 0
% 0.21/0.64 # Initial clauses : 102
% 0.21/0.64 # Removed in clause preprocessing : 3
% 0.21/0.64 # Initial clauses in saturation : 99
% 0.21/0.64 # Processed clauses : 1624
% 0.21/0.64 # ...of these trivial : 11
% 0.21/0.64 # ...subsumed : 840
% 0.21/0.64 # ...remaining for further processing : 773
% 0.21/0.64 # Other redundant clauses eliminated : 26
% 0.21/0.64 # Clauses deleted for lack of memory : 0
% 0.21/0.64 # Backward-subsumed : 104
% 0.21/0.64 # Backward-rewritten : 63
% 0.21/0.64 # Generated clauses : 3646
% 0.21/0.64 # ...of the previous two non-redundant : 3348
% 0.21/0.64 # ...aggressively subsumed : 0
% 0.21/0.64 # Contextual simplify-reflections : 61
% 0.21/0.64 # Paramodulations : 3549
% 0.21/0.64 # Factorizations : 4
% 0.21/0.64 # NegExts : 0
% 0.21/0.64 # Equation resolutions : 72
% 0.21/0.64 # Total rewrite steps : 3837
% 0.21/0.64 # Propositional unsat checks : 0
% 0.21/0.64 # Propositional check models : 0
% 0.21/0.64 # Propositional check unsatisfiable : 0
% 0.21/0.64 # Propositional clauses : 0
% 0.21/0.64 # Propositional clauses after purity: 0
% 0.21/0.64 # Propositional unsat core size : 0
% 0.21/0.64 # Propositional preprocessing time : 0.000
% 0.21/0.64 # Propositional encoding time : 0.000
% 0.21/0.64 # Propositional solver time : 0.000
% 0.21/0.64 # Success case prop preproc time : 0.000
% 0.21/0.64 # Success case prop encoding time : 0.000
% 0.21/0.64 # Success case prop solver time : 0.000
% 0.21/0.64 # Current number of processed clauses : 493
% 0.21/0.64 # Positive orientable unit clauses : 65
% 0.21/0.64 # Positive unorientable unit clauses: 0
% 0.21/0.64 # Negative unit clauses : 40
% 0.21/0.64 # Non-unit-clauses : 388
% 0.21/0.64 # Current number of unprocessed clauses: 1770
% 0.21/0.64 # ...number of literals in the above : 8649
% 0.21/0.64 # Current number of archived formulas : 0
% 0.21/0.64 # Current number of archived clauses : 279
% 0.21/0.64 # Clause-clause subsumption calls (NU) : 30332
% 0.21/0.64 # Rec. Clause-clause subsumption calls : 9646
% 0.21/0.64 # Non-unit clause-clause subsumptions : 590
% 0.21/0.64 # Unit Clause-clause subsumption calls : 2596
% 0.21/0.64 # Rewrite failures with RHS unbound : 0
% 0.21/0.64 # BW rewrite match attempts : 16
% 0.21/0.64 # BW rewrite match successes : 16
% 0.21/0.64 # Condensation attempts : 0
% 0.21/0.64 # Condensation successes : 0
% 0.21/0.64 # Termbank termtop insertions : 62190
% 0.21/0.64
% 0.21/0.64 # -------------------------------------------------
% 0.21/0.64 # User time : 0.121 s
% 0.21/0.64 # System time : 0.004 s
% 0.21/0.64 # Total time : 0.125 s
% 0.21/0.64 # Maximum resident set size: 1988 pages
% 0.21/0.64
% 0.21/0.64 # -------------------------------------------------
% 0.21/0.64 # User time : 0.476 s
% 0.21/0.64 # System time : 0.020 s
% 0.21/0.64 # Total time : 0.496 s
% 0.21/0.64 # Maximum resident set size: 1736 pages
% 0.21/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------