TSTP Solution File: NUM495+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM495+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 01:14:18 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 52 ( 18 unt; 0 def)
% Number of atoms : 150 ( 25 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 166 ( 68 ~; 64 |; 21 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mIH_03,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIH_03) ).
fof(m__2062,hypothesis,
( sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2062) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
fof(mDefDiff,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
=> ! [X3] :
( X3 = sdtmndt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefDiff) ).
fof(mAddComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).
fof(m__1883,hypothesis,
xr = sdtmndt0(xn,xp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1883) ).
fof(m__1870,hypothesis,
sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1870) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMulComm) ).
fof(m__,conjecture,
( doDivides0(xp,xr)
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1799,hypothesis,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( isPrime0(X3)
& doDivides0(X3,sdtasdt0(X1,X2)) )
=> ( iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
=> ( doDivides0(X3,X1)
| doDivides0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1799) ).
fof(m__1913,hypothesis,
doDivides0(xp,sdtasdt0(xr,xm)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1913) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1860) ).
fof(c_0_13,plain,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mIH_03]) ).
fof(c_0_14,hypothesis,
( sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(fof_simplification,[status(thm)],[m__2062]) ).
fof(c_0_15,plain,
! [X61,X62] :
( ~ aNaturalNumber0(X61)
| ~ aNaturalNumber0(X62)
| X61 = X62
| ~ sdtlseqdt0(X61,X62)
| iLess0(X61,X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,hypothesis,
( sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,hypothesis,
sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X5,X6] :
( ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| aNaturalNumber0(sdtpldt0(X5,X6)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_21,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xr,xm),xp)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_24,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xr,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_26,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
fof(c_0_27,plain,
! [X39,X40,X41] :
( ( aNaturalNumber0(X41)
| X41 != sdtmndt0(X40,X39)
| ~ sdtlseqdt0(X39,X40)
| ~ aNaturalNumber0(X39)
| ~ aNaturalNumber0(X40) )
& ( sdtpldt0(X39,X41) = X40
| X41 != sdtmndt0(X40,X39)
| ~ sdtlseqdt0(X39,X40)
| ~ aNaturalNumber0(X39)
| ~ aNaturalNumber0(X40) )
& ( ~ aNaturalNumber0(X41)
| sdtpldt0(X39,X41) != X40
| X41 = sdtmndt0(X40,X39)
| ~ sdtlseqdt0(X39,X40)
| ~ aNaturalNumber0(X39)
| ~ aNaturalNumber0(X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])])]) ).
cnf(c_0_28,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xr,xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_25]),c_0_26])]) ).
fof(c_0_29,plain,
! [X9,X10] :
( ~ aNaturalNumber0(X9)
| ~ aNaturalNumber0(X10)
| sdtpldt0(X9,X10) = sdtpldt0(X10,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])])]) ).
cnf(c_0_30,plain,
( aNaturalNumber0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ sdtlseqdt0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,hypothesis,
xr = sdtmndt0(xn,xp),
inference(split_conjunct,[status(thm)],[m__1883]) ).
cnf(c_0_32,hypothesis,
sdtlseqdt0(xp,xn),
inference(split_conjunct,[status(thm)],[m__1870]) ).
cnf(c_0_33,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(xr,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_23])]) ).
cnf(c_0_34,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,hypothesis,
( aNaturalNumber0(X1)
| X1 != xr ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_23]),c_0_26])]) ).
fof(c_0_36,plain,
! [X15,X16] :
( ~ aNaturalNumber0(X15)
| ~ aNaturalNumber0(X16)
| sdtasdt0(X15,X16) = sdtasdt0(X16,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_37,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xm,xr),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(xm,xr))
| ~ aNaturalNumber0(xr) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_25])]) ).
cnf(c_0_38,hypothesis,
aNaturalNumber0(xr),
inference(er,[status(thm)],[c_0_35]) ).
fof(c_0_39,negated_conjecture,
~ ( doDivides0(xp,xr)
| doDivides0(xp,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_40,hypothesis,
! [X89,X90,X91] :
( ~ aNaturalNumber0(X89)
| ~ aNaturalNumber0(X90)
| ~ aNaturalNumber0(X91)
| ~ isPrime0(X91)
| ~ doDivides0(X91,sdtasdt0(X89,X90))
| ~ iLess0(sdtpldt0(sdtpldt0(X89,X90),X91),sdtpldt0(sdtpldt0(xn,xm),xp))
| doDivides0(X91,X89)
| doDivides0(X91,X90) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1799])])]) ).
cnf(c_0_41,hypothesis,
doDivides0(xp,sdtasdt0(xr,xm)),
inference(split_conjunct,[status(thm)],[m__1913]) ).
cnf(c_0_42,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xm,xr),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(xm,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
fof(c_0_44,negated_conjecture,
( ~ doDivides0(xp,xr)
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])]) ).
cnf(c_0_45,hypothesis,
( doDivides0(X3,X1)
| doDivides0(X3,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X3)
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,hypothesis,
doDivides0(xp,sdtasdt0(xm,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_38]),c_0_25])]) ).
cnf(c_0_47,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_48,hypothesis,
iLess0(sdtpldt0(sdtpldt0(xm,xr),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_22]),c_0_38]),c_0_25])]) ).
cnf(c_0_49,negated_conjecture,
~ doDivides0(xp,xr),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_23]),c_0_38]),c_0_25])]),c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM495+1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.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 : Mon May 20 03:52:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --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.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26917 completed with status 0
% 0.19/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.19/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.19/0.51 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.19/0.51 # G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with pid 26927 completed with status 0
% 0.19/0.51 # Result found by G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S
% 0.19/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.19/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.19/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.19/0.51 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 47
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 85
% 0.19/0.51 # Removed in clause preprocessing : 3
% 0.19/0.51 # Initial clauses in saturation : 82
% 0.19/0.51 # Processed clauses : 255
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 41
% 0.19/0.51 # ...remaining for further processing : 214
% 0.19/0.51 # Other redundant clauses eliminated : 15
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 11
% 0.19/0.51 # Backward-rewritten : 12
% 0.19/0.51 # Generated clauses : 378
% 0.19/0.51 # ...of the previous two non-redundant : 342
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 349
% 0.19/0.51 # Factorizations : 2
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 27
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 381
% 0.19/0.51 # ...of those cached : 368
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 113
% 0.19/0.51 # Positive orientable unit clauses : 22
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 9
% 0.19/0.51 # Non-unit-clauses : 82
% 0.19/0.51 # Current number of unprocessed clauses: 241
% 0.19/0.51 # ...number of literals in the above : 944
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 100
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 2449
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 822
% 0.19/0.51 # Non-unit clause-clause subsumptions : 51
% 0.19/0.51 # Unit Clause-clause subsumption calls : 193
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 7
% 0.19/0.51 # BW rewrite match successes : 4
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 13923
% 0.19/0.51 # Search garbage collected termcells : 1348
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.023 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.028 s
% 0.19/0.51 # Maximum resident set size: 1964 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.101 s
% 0.19/0.51 # System time : 0.017 s
% 0.19/0.51 # Total time : 0.118 s
% 0.19/0.51 # Maximum resident set size: 1744 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------