TSTP Solution File: NUM475+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM475+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:26:23 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 30 unt; 0 def)
% Number of atoms : 183 ( 57 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 216 ( 92 ~; 90 |; 21 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 28 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(m__1347,hypothesis,
xl != sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1347) ).
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/sandbox/benchmark/theBenchmark.p',mDefDiff) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( aNaturalNumber0(X3)
& sdtpldt0(X1,X3) = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1324_04,hypothesis,
( doDivides0(xl,xm)
& doDivides0(xl,sdtpldt0(xm,xn)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324_04) ).
fof(m__1360,hypothesis,
xp = sdtsldt0(xm,xl),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1360) ).
fof(m__1324,hypothesis,
( aNaturalNumber0(xl)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).
fof(m__1395,hypothesis,
sdtlseqdt0(xp,xq),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1395) ).
fof(m__1422,hypothesis,
xr = sdtmndt0(xq,xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1422) ).
fof(m__1379,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1379) ).
fof(m__1459,hypothesis,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1459) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__,conjecture,
xn = sdtasdt0(xl,xr),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(c_0_14,plain,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[mDefQuot]) ).
fof(c_0_15,plain,
! [X49,X50,X51] :
( ( aNaturalNumber0(X51)
| X51 != sdtsldt0(X50,X49)
| X49 = sz00
| ~ doDivides0(X49,X50)
| ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X50) )
& ( X50 = sdtasdt0(X49,X51)
| X51 != sdtsldt0(X50,X49)
| X49 = sz00
| ~ doDivides0(X49,X50)
| ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X50) )
& ( ~ aNaturalNumber0(X51)
| X50 != sdtasdt0(X49,X51)
| X51 = sdtsldt0(X50,X49)
| X49 = sz00
| ~ doDivides0(X49,X50)
| ~ aNaturalNumber0(X49)
| ~ aNaturalNumber0(X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_16,hypothesis,
xl != sz00,
inference(fof_simplification,[status(thm)],[m__1347]) ).
fof(c_0_17,plain,
! [X60,X61,X62] :
( ( aNaturalNumber0(X62)
| X62 != sdtmndt0(X61,X60)
| ~ sdtlseqdt0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( sdtpldt0(X60,X62) = X61
| X62 != sdtmndt0(X61,X60)
| ~ sdtlseqdt0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) )
& ( ~ aNaturalNumber0(X62)
| sdtpldt0(X60,X62) != X61
| X62 = sdtmndt0(X61,X60)
| ~ sdtlseqdt0(X60,X61)
| ~ aNaturalNumber0(X60)
| ~ aNaturalNumber0(X61) ) ),
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])])])])]) ).
fof(c_0_18,plain,
! [X31,X32,X34] :
( ( aNaturalNumber0(esk2_2(X31,X32))
| ~ sdtlseqdt0(X31,X32)
| ~ aNaturalNumber0(X31)
| ~ aNaturalNumber0(X32) )
& ( sdtpldt0(X31,esk2_2(X31,X32)) = X32
| ~ sdtlseqdt0(X31,X32)
| ~ aNaturalNumber0(X31)
| ~ aNaturalNumber0(X32) )
& ( ~ aNaturalNumber0(X34)
| sdtpldt0(X31,X34) != X32
| sdtlseqdt0(X31,X32)
| ~ aNaturalNumber0(X31)
| ~ aNaturalNumber0(X32) ) ),
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)],[mDefLE])])])])])]) ).
fof(c_0_19,plain,
! [X15,X16] :
( ~ aNaturalNumber0(X15)
| ~ aNaturalNumber0(X16)
| aNaturalNumber0(sdtpldt0(X15,X16)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
cnf(c_0_20,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]) ).
fof(c_0_21,hypothesis,
xl != sz00,
inference(fof_nnf,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( aNaturalNumber0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ sdtlseqdt0(X3,X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,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_24,plain,
( sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_27,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_28,hypothesis,
xp = sdtsldt0(xm,xl),
inference(split_conjunct,[status(thm)],[m__1360]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_31,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( aNaturalNumber0(sdtmndt0(X1,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_33,hypothesis,
sdtlseqdt0(xp,xq),
inference(split_conjunct,[status(thm)],[m__1395]) ).
cnf(c_0_34,hypothesis,
xr = sdtmndt0(xq,xp),
inference(split_conjunct,[status(thm)],[m__1422]) ).
cnf(c_0_35,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_36,hypothesis,
doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[m__1324_04]) ).
cnf(c_0_37,hypothesis,
xq = sdtsldt0(sdtpldt0(xm,xn),xl),
inference(split_conjunct,[status(thm)],[m__1379]) ).
cnf(c_0_38,plain,
( X1 = sdtmndt0(X3,X2)
| ~ aNaturalNumber0(X1)
| sdtpldt0(X2,X1) != X3
| ~ sdtlseqdt0(X2,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_39,plain,
( sdtlseqdt0(X1,sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_24]),c_0_25]) ).
cnf(c_0_40,hypothesis,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
inference(split_conjunct,[status(thm)],[m__1459]) ).
cnf(c_0_41,hypothesis,
sdtasdt0(xl,xp) = xm,
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_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_42,hypothesis,
( aNaturalNumber0(xr)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xq) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_43,hypothesis,
aNaturalNumber0(xp),
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_35,c_0_27]),c_0_28]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_44,hypothesis,
( aNaturalNumber0(xq)
| ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_29])]),c_0_31]) ).
cnf(c_0_45,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1324]) ).
cnf(c_0_46,plain,
( sdtmndt0(sdtpldt0(X1,X2),X1) = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_25]),c_0_39]) ).
cnf(c_0_47,hypothesis,
sdtpldt0(xm,sdtasdt0(xl,xr)) = sdtpldt0(xm,xn),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_41]) ).
fof(c_0_48,plain,
! [X63,X64] :
( ~ aNaturalNumber0(X63)
| ~ aNaturalNumber0(X64)
| aNaturalNumber0(sdtasdt0(X63,X64)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_49,hypothesis,
( aNaturalNumber0(xr)
| ~ aNaturalNumber0(xq) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_50,hypothesis,
aNaturalNumber0(xq),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_25]),c_0_45]),c_0_30])]) ).
fof(c_0_51,negated_conjecture,
xn != sdtasdt0(xl,xr),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_52,hypothesis,
( sdtmndt0(sdtpldt0(xm,xn),xm) = sdtasdt0(xl,xr)
| ~ aNaturalNumber0(sdtasdt0(xl,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_30])]) ).
cnf(c_0_53,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,hypothesis,
aNaturalNumber0(xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
fof(c_0_55,negated_conjecture,
xn != sdtasdt0(xl,xr),
inference(fof_nnf,[status(thm)],[c_0_51]) ).
cnf(c_0_56,hypothesis,
sdtmndt0(sdtpldt0(xm,xn),xm) = sdtasdt0(xl,xr),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_29])]) ).
cnf(c_0_57,negated_conjecture,
xn != sdtasdt0(xl,xr),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_56]),c_0_30]),c_0_45])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM475+1 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n014.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 04:19:22 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 22803 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 22807 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.14/0.41 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 42
% 0.14/0.41 # Removed by relevancy pruning/SinE : 5
% 0.14/0.41 # Initial clauses : 61
% 0.14/0.41 # Removed in clause preprocessing : 1
% 0.14/0.41 # Initial clauses in saturation : 60
% 0.14/0.41 # Processed clauses : 245
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 65
% 0.14/0.41 # ...remaining for further processing : 180
% 0.14/0.41 # Other redundant clauses eliminated : 13
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 2
% 0.14/0.41 # Backward-rewritten : 14
% 0.14/0.41 # Generated clauses : 400
% 0.14/0.41 # ...of the previous two non-redundant : 375
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 7
% 0.14/0.41 # Paramodulations : 381
% 0.14/0.41 # Factorizations : 2
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 17
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 372
% 0.14/0.41 # ...of those cached : 353
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 100
% 0.14/0.41 # Positive orientable unit clauses : 23
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 2
% 0.14/0.41 # Non-unit-clauses : 75
% 0.14/0.41 # Current number of unprocessed clauses: 242
% 0.14/0.41 # ...number of literals in the above : 1037
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 71
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 973
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 451
% 0.14/0.41 # Non-unit clause-clause subsumptions : 73
% 0.14/0.41 # Unit Clause-clause subsumption calls : 27
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 7
% 0.14/0.41 # BW rewrite match successes : 7
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 11146
% 0.14/0.41 # Search garbage collected termcells : 991
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.019 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.021 s
% 0.14/0.41 # Maximum resident set size: 1876 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.020 s
% 0.14/0.41 # System time : 0.004 s
% 0.14/0.41 # Total time : 0.024 s
% 0.14/0.41 # Maximum resident set size: 1732 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------