%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM435+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:55:01 PM UTC 2026
% Result : Theorem 0.15s 5.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 57 ( 31 unt; 0 def)
% Number of atoms : 143 ( 50 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 142 ( 56 ~; 36 |; 42 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 24 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDivisor) ).
fof(m__1003,hypothesis,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [X1] :
( sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) )
& sdtasdt0(xp,xq) != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1003) ).
fof(m__979,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
fof(m__1032,hypothesis,
( sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb))
& aInteger0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aInteger0(X2)
& aInteger0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(m__,conjecture,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X3)
& aInteger0(X2)
& aInteger0(X1) )
=> sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(c_0_9,plain,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( ? [X3] :
( sdtasdt0(X2,X3) = X1
& aInteger0(X3) )
& X2 != sz00
& aInteger0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[mDivisor]) ).
fof(c_0_10,hypothesis,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& ? [X1] :
( sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb))
& aInteger0(X1) )
& sdtasdt0(xp,xq) != sz00 ),
inference(fof_simplification,[status(thm)],[m__1003]) ).
fof(c_0_11,plain,
! [X30,X31,X33,X34] :
( ( ~ aInteger0(X30)
| aDivisorOf0(X33,X30)
| sdtasdt0(X33,X34) != X30
| ~ aInteger0(X34)
| X33 = sz00
| ~ aInteger0(X33) )
& ( ~ aInteger0(X30)
| ~ aDivisorOf0(X31,X30)
| sdtasdt0(X31,esk2_2(X30,X31)) = X30 )
& ( ~ aInteger0(X30)
| ~ aDivisorOf0(X31,X30)
| aInteger0(esk2_2(X30,X31)) )
& ( ~ aInteger0(X30)
| ~ aDivisorOf0(X31,X30)
| X31 != sz00 )
& ( ~ aInteger0(X30)
| ~ aDivisorOf0(X31,X30)
| aInteger0(X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
fof(c_0_12,hypothesis,
( sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb))
& aInteger0(esk1_0)
& sdtasdt0(xp,xq) != sz00 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_10])])]) ).
fof(c_0_13,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_simplification,[status(thm)],[m__979]) ).
cnf(c_0_14,plain,
( ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2)
| aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,hypothesis,
aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X38,X39] :
( aInteger0(sdtpldt0(X38,X39))
| ~ aInteger0(X39)
| ~ aInteger0(X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])])]) ).
fof(c_0_17,hypothesis,
( xq != sz00
& aInteger0(xq)
& xp != sz00
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
( ~ aInteger0(sdtpldt0(xa,smndt0(xb)))
| aInteger0(sdtasdt0(xp,xq)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| aInteger0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X46] :
( aInteger0(smndt0(X46))
| ~ aInteger0(X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])])]) ).
cnf(c_0_22,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1032]) ).
fof(c_0_24,plain,
! [X25,X26] :
( sdtasdt0(X25,X26) = sdtasdt0(X26,X25)
| ~ aInteger0(X26)
| ~ aInteger0(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_25,hypothesis,
( ~ aInteger0(smndt0(xb))
| aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_26,plain,
( ~ aInteger0(X1)
| aInteger0(smndt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_28,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_29,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtasdt0(sdtasdt0(xp,xq),xm),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,hypothesis,
aInteger0(sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,hypothesis,
aInteger0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_33,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(fof_simplification,[status(thm)],[c_0_28]) ).
cnf(c_0_34,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(esk1_0,sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_35,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
fof(c_0_36,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(fof_nnf,[status(thm)],[c_0_33]) ).
cnf(c_0_37,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtasdt0(esk1_0,sdtasdt0(xp,xq)),
inference(rw,[status(thm)],[c_0_29,c_0_34]) ).
cnf(c_0_38,hypothesis,
sdtasdt0(esk1_0,sdtasdt0(xp,xq)) = sdtasdt0(xm,sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_34]),c_0_35]),c_0_31])]) ).
fof(c_0_39,plain,
! [X22,X23,X24] :
( sdtasdt0(X22,sdtasdt0(X23,X24)) = sdtasdt0(sdtasdt0(X22,X23),X24)
| ~ aInteger0(X24)
| ~ aInteger0(X23)
| ~ aInteger0(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
cnf(c_0_40,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtasdt0(xm,sdtasdt0(xp,xq)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_44,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_45,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),xm) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_46,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xm,sdtasdt0(xp,xq)),
inference(rw,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_47,hypothesis,
sdtasdt0(xm,sdtasdt0(xp,xq)) = sdtasdt0(xp,sdtasdt0(xq,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32]),c_0_43]),c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
sdtasdt0(esk1_0,sdtasdt0(xp,xq)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_45,c_0_34]) ).
cnf(c_0_49,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(xq,esk1_0)),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
sdtasdt0(xm,sdtasdt0(xp,xq)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_48,c_0_38]) ).
cnf(c_0_51,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,esk1_0)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_49]),c_0_35]),c_0_43]),c_0_44])]) ).
cnf(c_0_52,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xp,sdtasdt0(xq,esk1_0)),
inference(rw,[status(thm)],[c_0_50,c_0_47]) ).
cnf(c_0_53,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_49,c_0_51]) ).
cnf(c_0_54,plain,
( ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X2,sdtasdt0(X1,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_30]) ).
cnf(c_0_55,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_56,hypothesis,
$false,
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_53,c_0_54]),c_0_35]),c_0_44]),c_0_43])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM435+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n003.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 02:30:54 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.48 % Version: 3.5.1
% 0.15/5.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.48 % Starting sh5l with 300s (1) cores
% 0.15/5.48 % new_bool_3 with pid 3209998 completed with status 0
% 0.15/5.48 % Result found by new_bool_3
% 0.15/5.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.48 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/5.48 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.48 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.48 % SubtermCWHack with pid 3210001 completed with status 0
% 0.15/5.48 % Result found by SubtermCWHack
% 0.15/5.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.48 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/5.48 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.48 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.48 % Preprocessing time : 0.002 s
% 0.15/5.48
% 0.15/5.48 % Proof found!
% 0.15/5.48 % SZS status Theorem
% 0.15/5.48 % SZS output start CNFRefutation
% See solution above
% 0.15/5.48 % Parsed axioms : 26
% 0.15/5.48 % Removed by relevancy pruning/SinE : 3
% 0.15/5.48 % Initial clauses : 42
% 0.15/5.48 % Removed in clause preprocessing : 1
% 0.15/5.48 % Initial clauses in saturation : 41
% 0.15/5.48 % Processed clauses : 440
% 0.15/5.48 % ...of these trivial : 5
% 0.15/5.48 % ...subsumed : 265
% 0.15/5.48 % ...remaining for further processing : 170
% 0.15/5.48 % Other redundant clauses eliminated : 5
% 0.15/5.48 % Clauses deleted for lack of memory : 0
% 0.15/5.48 % Backward-subsumed : 2
% 0.15/5.48 % Backward-rewritten : 40
% 0.15/5.48 % Generated clauses : 2337
% 0.15/5.48 % ...of the previous two non-redundant : 1867
% 0.15/5.48 % ...aggressively subsumed : 0
% 0.15/5.48 % Contextual simplify-reflections : 18
% 0.15/5.48 % Paramodulations : 2332
% 0.15/5.48 % Factorizations : 0
% 0.15/5.48 % NegExts : 0
% 0.15/5.48 % Equation resolutions : 5
% 0.15/5.48 % Disequality decompositions : 0
% 0.15/5.48 % Total rewrite steps : 2633
% 0.15/5.48 % ...of those cached : 2599
% 0.15/5.48 % Propositional unsat checks : 0
% 0.15/5.48 % Propositional check models : 0
% 0.15/5.48 % Propositional check unsatisfiable : 0
% 0.15/5.48 % Propositional clauses : 0
% 0.15/5.48 % Propositional clauses after purity: 0
% 0.15/5.48 % Propositional unsat core size : 0
% 0.15/5.48 % Propositional preprocessing time : 0.000
% 0.15/5.48 % Propositional encoding time : 0.000
% 0.15/5.48 % Propositional solver time : 0.000
% 0.15/5.48 % Success case prop preproc time : 0.000
% 0.15/5.48 % Success case prop encoding time : 0.000
% 0.15/5.48 % Success case prop solver time : 0.000
% 0.15/5.48 % Current number of processed clauses : 126
% 0.15/5.48 % Positive orientable unit clauses : 33
% 0.15/5.48 % Positive unorientable unit clauses: 0
% 0.15/5.48 % Negative unit clauses : 4
% 0.15/5.48 % Non-unit-clauses : 89
% 0.15/5.48 % Current number of unprocessed clauses: 1400
% 0.15/5.48 % ...number of literals in the above : 6005
% 0.15/5.48 % Current number of archived formulas : 0
% 0.15/5.48 % Current number of archived clauses : 42
% 0.15/5.48 % Clause-clause subsumption calls (NU) : 2398
% 0.15/5.48 % Rec. Clause-clause subsumption calls : 1719
% 0.15/5.48 % Non-unit clause-clause subsumptions : 284
% 0.15/5.48 % Unit Clause-clause subsumption calls : 17
% 0.15/5.48 % Rewrite failures with RHS unbound : 0
% 0.15/5.48 % BW rewrite match attempts : 10
% 0.15/5.48 % BW rewrite match successes : 10
% 0.15/5.48 % Condensation attempts : 0
% 0.15/5.48 % Condensation successes : 0
% 0.15/5.48 % Termbank termtop insertions : 39933
% 0.15/5.48 % Search garbage collected termcells : 524
% 0.15/5.48
% 0.15/5.48 % -------------------------------------------------
% 0.15/5.48 % User time : 0.040 s
% 0.15/5.48 % System time : 0.002 s
% 0.15/5.48 % Total time : 0.042 s
% 0.15/5.48 % Maximum resident set size: 3660 pages
% 0.15/5.48
% 0.15/5.48 % -------------------------------------------------
% 0.15/5.48 % User time : 0.040 s
% 0.15/5.48 % System time : 0.008 s
% 0.15/5.48 % Total time : 0.049 s
% 0.15/5.48 % Maximum resident set size: 4864 pages
% 0.15/5.48 % E exiting
%------------------------------------------------------------------------------