TSTP Solution File: RNG061+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG061+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 02:36:06 EDT 2024
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 51 ( 24 unt; 0 def)
% Number of atoms : 128 ( 56 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 127 ( 50 ~; 41 |; 26 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 11 con; 0-2 aty)
% Number of variables : 37 ( 1 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSPN,axiom,
! [X1,X2] :
( ( aVector0(X1)
& aVector0(X2) )
=> ( ( aDimensionOf0(X1) = aDimensionOf0(X2)
& aDimensionOf0(X2) != sz00 )
=> sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSPN) ).
fof(m__1692,hypothesis,
aDimensionOf0(xs) != sz00,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1692) ).
fof(m__1726,hypothesis,
( aVector0(xq)
& szszuzczcdt0(aDimensionOf0(xq)) = aDimensionOf0(xt)
& ! [X1] :
( aNaturalNumber0(X1)
=> sdtlbdtrb0(xq,X1) = sdtlbdtrb0(xt,X1) )
& xq = sziznziztdt0(xt) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1726) ).
fof(m__1766,hypothesis,
( aScalar0(xB)
& xB = sdtlbdtrb0(xt,aDimensionOf0(xt)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1766) ).
fof(m__1678_01,hypothesis,
aDimensionOf0(xs) = aDimensionOf0(xt),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1678_01) ).
fof(m__1678,hypothesis,
( aVector0(xs)
& aVector0(xt) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1678) ).
fof(mScPr,axiom,
! [X1,X2] :
( ( aVector0(X1)
& aVector0(X2) )
=> ( aDimensionOf0(X1) = aDimensionOf0(X2)
=> aScalar0(sdtasasdt0(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mScPr) ).
fof(m__1800,hypothesis,
( aScalar0(xD)
& xD = sdtasasdt0(xq,xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1800) ).
fof(m__1854,hypothesis,
( aScalar0(xG)
& xG = sdtasdt0(xB,xB) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1854) ).
fof(mArith,axiom,
! [X1,X2,X3] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
& sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
& sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
& sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mArith) ).
fof(m__,conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2180,hypothesis,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2180) ).
fof(mNegSc,axiom,
! [X1] :
( aScalar0(X1)
=> aScalar0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNegSc) ).
fof(m__1949,hypothesis,
( aScalar0(xN)
& xN = sdtasdt0(xR,xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1949) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulSc) ).
fof(m__1930,hypothesis,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).
fof(c_0_16,plain,
! [X1,X2] :
( ( aVector0(X1)
& aVector0(X2) )
=> ( ( aDimensionOf0(X1) = aDimensionOf0(X2)
& aDimensionOf0(X2) != sz00 )
=> sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2)))) ) ),
inference(fof_simplification,[status(thm)],[mDefSPN]) ).
fof(c_0_17,hypothesis,
aDimensionOf0(xs) != sz00,
inference(fof_simplification,[status(thm)],[m__1692]) ).
fof(c_0_18,plain,
! [X73,X74] :
( ~ aVector0(X73)
| ~ aVector0(X74)
| aDimensionOf0(X73) != aDimensionOf0(X74)
| aDimensionOf0(X74) = sz00
| sdtasasdt0(X73,X74) = sdtpldt0(sdtasasdt0(sziznziztdt0(X73),sziznziztdt0(X74)),sdtasdt0(sdtlbdtrb0(X73,aDimensionOf0(X73)),sdtlbdtrb0(X74,aDimensionOf0(X74)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_19,hypothesis,
! [X79] :
( aVector0(xq)
& szszuzczcdt0(aDimensionOf0(xq)) = aDimensionOf0(xt)
& ( ~ aNaturalNumber0(X79)
| sdtlbdtrb0(xq,X79) = sdtlbdtrb0(xt,X79) )
& xq = sziznziztdt0(xt) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1726])])])]) ).
cnf(c_0_20,hypothesis,
xB = sdtlbdtrb0(xt,aDimensionOf0(xt)),
inference(split_conjunct,[status(thm)],[m__1766]) ).
cnf(c_0_21,hypothesis,
aDimensionOf0(xs) = aDimensionOf0(xt),
inference(split_conjunct,[status(thm)],[m__1678_01]) ).
fof(c_0_22,hypothesis,
aDimensionOf0(xs) != sz00,
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( aDimensionOf0(X2) = sz00
| sdtasasdt0(X1,X2) = sdtpldt0(sdtasasdt0(sziznziztdt0(X1),sziznziztdt0(X2)),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),sdtlbdtrb0(X2,aDimensionOf0(X2))))
| ~ aVector0(X1)
| ~ aVector0(X2)
| aDimensionOf0(X1) != aDimensionOf0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
xq = sziznziztdt0(xt),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,hypothesis,
sdtlbdtrb0(xt,aDimensionOf0(xs)) = xB,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
aVector0(xt),
inference(split_conjunct,[status(thm)],[m__1678]) ).
cnf(c_0_27,hypothesis,
aDimensionOf0(xs) != sz00,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X69,X70] :
( ~ aVector0(X69)
| ~ aVector0(X70)
| aDimensionOf0(X69) != aDimensionOf0(X70)
| aScalar0(sdtasasdt0(X69,X70)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mScPr])])]) ).
cnf(c_0_29,hypothesis,
( sdtpldt0(sdtasasdt0(sziznziztdt0(X1),xq),sdtasdt0(sdtlbdtrb0(X1,aDimensionOf0(X1)),xB)) = sdtasasdt0(X1,xt)
| aDimensionOf0(X1) != aDimensionOf0(xs)
| ~ aVector0(X1) ),
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_23,c_0_21]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_30,hypothesis,
xD = sdtasasdt0(xq,xq),
inference(split_conjunct,[status(thm)],[m__1800]) ).
cnf(c_0_31,hypothesis,
xG = sdtasdt0(xB,xB),
inference(split_conjunct,[status(thm)],[m__1854]) ).
fof(c_0_32,plain,
! [X21,X22,X23] :
( ( sdtpldt0(sdtpldt0(X21,X22),X23) = sdtpldt0(X21,sdtpldt0(X22,X23))
| ~ aScalar0(X21)
| ~ aScalar0(X22)
| ~ aScalar0(X23) )
& ( sdtpldt0(X21,X22) = sdtpldt0(X22,X21)
| ~ aScalar0(X21)
| ~ aScalar0(X22)
| ~ aScalar0(X23) )
& ( sdtasdt0(sdtasdt0(X21,X22),X23) = sdtasdt0(X21,sdtasdt0(X22,X23))
| ~ aScalar0(X21)
| ~ aScalar0(X22)
| ~ aScalar0(X23) )
& ( sdtasdt0(X21,X22) = sdtasdt0(X22,X21)
| ~ aScalar0(X21)
| ~ aScalar0(X22)
| ~ aScalar0(X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])])]) ).
cnf(c_0_33,plain,
( aScalar0(sdtasasdt0(X1,X2))
| ~ aVector0(X1)
| ~ aVector0(X2)
| aDimensionOf0(X1) != aDimensionOf0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,hypothesis,
sdtasasdt0(xt,xt) = sdtpldt0(xD,xG),
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_29,c_0_21]),c_0_24]),c_0_30]),c_0_25]),c_0_31]),c_0_26])]) ).
fof(c_0_35,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_36,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,hypothesis,
aScalar0(sdtpldt0(xD,xG)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26])]) ).
fof(c_0_38,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
inference(fof_nnf,[status(thm)],[c_0_35]) ).
cnf(c_0_39,hypothesis,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),
inference(split_conjunct,[status(thm)],[m__2180]) ).
cnf(c_0_40,hypothesis,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_42,plain,
! [X19] :
( ~ aScalar0(X19)
| aScalar0(smndt0(X19)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mNegSc])])]) ).
cnf(c_0_43,hypothesis,
( ~ aScalar0(sdtasdt0(xS,xS))
| ~ aScalar0(smndt0(xN)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,plain,
( aScalar0(smndt0(X1))
| ~ aScalar0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
fof(c_0_46,plain,
! [X17,X18] :
( ~ aScalar0(X17)
| ~ aScalar0(X18)
| aScalar0(sdtasdt0(X17,X18)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])])]) ).
cnf(c_0_47,hypothesis,
~ aScalar0(sdtasdt0(xS,xS)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_48,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_49,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_50,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : RNG061+2 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 12:19:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.22/0.54 # Version: 3.1.0
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15526 completed with status 0
% 0.22/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.22/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.54 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 15538 completed with status 0
% 0.22/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.22/0.54 # Preprocessing time : 0.002 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Theorem
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 60
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 100
% 0.22/0.54 # Removed in clause preprocessing : 5
% 0.22/0.54 # Initial clauses in saturation : 95
% 0.22/0.54 # Processed clauses : 242
% 0.22/0.54 # ...of these trivial : 5
% 0.22/0.54 # ...subsumed : 11
% 0.22/0.54 # ...remaining for further processing : 226
% 0.22/0.54 # Other redundant clauses eliminated : 5
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 2
% 0.22/0.54 # Backward-rewritten : 4
% 0.22/0.54 # Generated clauses : 745
% 0.22/0.54 # ...of the previous two non-redundant : 696
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 738
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 7
% 0.22/0.54 # Disequality decompositions : 0
% 0.22/0.54 # Total rewrite steps : 636
% 0.22/0.54 # ...of those cached : 594
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 122
% 0.22/0.54 # Positive orientable unit clauses : 56
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 3
% 0.22/0.54 # Non-unit-clauses : 63
% 0.22/0.54 # Current number of unprocessed clauses: 628
% 0.22/0.54 # ...number of literals in the above : 2726
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 101
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 2973
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 1199
% 0.22/0.54 # Non-unit clause-clause subsumptions : 8
% 0.22/0.54 # Unit Clause-clause subsumption calls : 96
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 3
% 0.22/0.54 # BW rewrite match successes : 3
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 20776
% 0.22/0.54 # Search garbage collected termcells : 890
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.030 s
% 0.22/0.54 # System time : 0.004 s
% 0.22/0.54 # Total time : 0.034 s
% 0.22/0.54 # Maximum resident set size: 1956 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.133 s
% 0.22/0.54 # System time : 0.016 s
% 0.22/0.54 # Total time : 0.148 s
% 0.22/0.54 # Maximum resident set size: 1760 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------