TSTP Solution File: NUM435+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM435+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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 : 600s
% DateTime : Mon Jul 18 09:32:24 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 36 unt; 0 def)
% Number of atoms : 142 ( 49 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 133 ( 56 ~; 44 |; 26 &)
% ( 1 <=>; 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 : 43 ( 1 sgn 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1003,hypothesis,
( sdtasdt0(xp,xq) != sz00
& ? [X1] :
( aInteger0(X1)
& sdtasdt0(sdtasdt0(xp,xq),X1) = sdtpldt0(xa,smndt0(xb)) )
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1003) ).
fof(m__1032,hypothesis,
( aInteger0(xm)
& sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1032) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aInteger0(X1)
& aInteger0(X2)
& aInteger0(X3) )
=> sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulAsso) ).
fof(m__979,hypothesis,
( aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& xp != sz00
& aInteger0(xq)
& xq != sz00 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__979) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).
fof(m__,conjecture,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mIntPlus,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntPlus) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntNeg) ).
fof(mDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ! [X2] :
( aDivisorOf0(X2,X1)
<=> ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDivisor) ).
fof(mIntMult,axiom,
! [X1,X2] :
( ( aInteger0(X1)
& aInteger0(X2) )
=> aInteger0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIntMult) ).
fof(c_0_10,hypothesis,
( sdtasdt0(xp,xq) != sz00
& aInteger0(esk1_0)
& sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb))
& aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
& sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1003])])])]) ).
cnf(c_0_11,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtpldt0(xa,smndt0(xb)),
inference(split_conjunct,[status(thm)],[m__1032]) ).
fof(c_0_13,plain,
! [X4,X5,X6] :
( ~ aInteger0(X4)
| ~ aInteger0(X5)
| ~ aInteger0(X6)
| sdtasdt0(X4,sdtasdt0(X5,X6)) = sdtasdt0(sdtasdt0(X4,X5),X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
cnf(c_0_14,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(sdtasdt0(xp,xq),esk1_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,hypothesis,
aInteger0(xm),
inference(split_conjunct,[status(thm)],[m__1032]) ).
cnf(c_0_17,hypothesis,
aInteger0(xq),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_18,hypothesis,
aInteger0(xp),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_19,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),esk1_0),
inference(rw,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,hypothesis,
sdtasdt0(sdtasdt0(xp,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_14,c_0_15]),c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,hypothesis,
aInteger0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_23,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = 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_15,c_0_20]),c_0_21]),c_0_17]),c_0_18])]) ).
cnf(c_0_25,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_27,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,esk1_0)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,esk1_0)) = sdtasdt0(xp,sdtasdt0(xm,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_17])]) ).
cnf(c_0_29,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_14,c_0_20]) ).
fof(c_0_30,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(fof_simplification,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntPlus])]) ).
cnf(c_0_32,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xm,xq)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xq)) = sdtasdt0(xp,sdtasdt0(esk1_0,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_21]),c_0_17])]) ).
cnf(c_0_34,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(xq,esk1_0)),
inference(rw,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,hypothesis,
aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,hypothesis,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(esk1_0,xq)),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,hypothesis,
aInteger0(xa),
inference(split_conjunct,[status(thm)],[m__979]) ).
fof(c_0_40,plain,
! [X2] :
( ~ aInteger0(X2)
| aInteger0(smndt0(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).
cnf(c_0_41,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(xm,xq)),
inference(rw,[status(thm)],[c_0_34,c_0_28]) ).
cnf(c_0_42,negated_conjecture,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) != sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_12]),c_0_14]) ).
fof(c_0_43,plain,
! [X4,X5,X5,X7] :
( ( aInteger0(X5)
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( X5 != sz00
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( aInteger0(esk2_2(X4,X5))
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( sdtasdt0(X5,esk2_2(X4,X5)) = X4
| ~ aDivisorOf0(X5,X4)
| ~ aInteger0(X4) )
& ( ~ aInteger0(X5)
| X5 = sz00
| ~ aInteger0(X7)
| sdtasdt0(X5,X7) != X4
| aDivisorOf0(X5,X4)
| ~ aInteger0(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivisor])])])])])])]) ).
cnf(c_0_44,hypothesis,
aDivisorOf0(sdtasdt0(xp,xq),sdtasdt0(sdtasdt0(xp,xq),esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_12]),c_0_14]) ).
cnf(c_0_45,hypothesis,
( aInteger0(sdtasdt0(xp,sdtasdt0(esk1_0,xq)))
| ~ aInteger0(smndt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_46,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,hypothesis,
aInteger0(xb),
inference(split_conjunct,[status(thm)],[m__979]) ).
cnf(c_0_48,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),xm) = sdtasdt0(xp,sdtasdt0(esk1_0,xq)),
inference(rw,[status(thm)],[c_0_41,c_0_33]) ).
cnf(c_0_49,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk1_0) = sdtasdt0(xp,sdtasdt0(esk1_0,xq)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_24]),c_0_28]),c_0_33]) ).
cnf(c_0_50,negated_conjecture,
( sdtasdt0(xq,sdtasdt0(xp,xm)) != sdtasdt0(esk1_0,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_21])]) ).
cnf(c_0_51,plain,
( aInteger0(X2)
| ~ aInteger0(X1)
| ~ aDivisorOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,hypothesis,
aDivisorOf0(sdtasdt0(xp,xq),sdtasdt0(xp,sdtasdt0(esk1_0,xq))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_20]),c_0_24]),c_0_28]),c_0_33]) ).
cnf(c_0_53,hypothesis,
aInteger0(sdtasdt0(xp,sdtasdt0(esk1_0,xq))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
fof(c_0_54,plain,
! [X3,X4] :
( ~ aInteger0(X3)
| ~ aInteger0(X4)
| aInteger0(sdtasdt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntMult])]) ).
cnf(c_0_55,hypothesis,
( sdtasdt0(xp,sdtasdt0(esk1_0,xq)) = sdtasdt0(xm,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_48]),c_0_16])]) ).
cnf(c_0_56,hypothesis,
( sdtasdt0(xp,sdtasdt0(esk1_0,xq)) = sdtasdt0(esk1_0,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_49]),c_0_21])]) ).
cnf(c_0_57,negated_conjecture,
( sdtasdt0(xq,sdtasdt0(xm,xp)) != sdtasdt0(esk1_0,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_25]),c_0_16]),c_0_18])]) ).
cnf(c_0_58,hypothesis,
aInteger0(sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_59,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,hypothesis,
( sdtasdt0(xm,sdtasdt0(xp,xq)) = sdtasdt0(esk1_0,sdtasdt0(xp,xq))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
sdtasdt0(xq,sdtasdt0(xm,xp)) != sdtasdt0(esk1_0,sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_62,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_59]) ).
cnf(c_0_63,hypothesis,
sdtasdt0(xm,sdtasdt0(xp,xq)) = sdtasdt0(esk1_0,sdtasdt0(xp,xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_58])]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_17]),c_0_18]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM435+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n005.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 : 600
% 0.13/0.34 % DateTime : Wed Jul 6 06:34:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.009 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 65
% 0.23/1.42 # Proof object clause steps : 46
% 0.23/1.42 # Proof object formula steps : 19
% 0.23/1.42 # Proof object conjectures : 9
% 0.23/1.42 # Proof object clause conjectures : 6
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 16
% 0.23/1.42 # Proof object initial formulas used : 10
% 0.23/1.42 # Proof object generating inferences : 14
% 0.23/1.42 # Proof object simplifying inferences : 60
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 26
% 0.23/1.42 # Removed by relevancy pruning/SinE : 3
% 0.23/1.42 # Initial clauses : 42
% 0.23/1.42 # Removed in clause preprocessing : 1
% 0.23/1.42 # Initial clauses in saturation : 41
% 0.23/1.42 # Processed clauses : 185
% 0.23/1.42 # ...of these trivial : 8
% 0.23/1.42 # ...subsumed : 52
% 0.23/1.42 # ...remaining for further processing : 125
% 0.23/1.42 # Other redundant clauses eliminated : 4
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 2
% 0.23/1.42 # Backward-rewritten : 48
% 0.23/1.42 # Generated clauses : 752
% 0.23/1.42 # ...of the previous two non-trivial : 641
% 0.23/1.42 # Contextual simplify-reflections : 8
% 0.23/1.42 # Paramodulations : 746
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 6
% 0.23/1.42 # Current number of processed clauses : 75
% 0.23/1.42 # Positive orientable unit clauses : 22
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 5
% 0.23/1.42 # Non-unit-clauses : 48
% 0.23/1.42 # Current number of unprocessed clauses: 280
% 0.23/1.42 # ...number of literals in the above : 1165
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 50
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 575
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 406
% 0.23/1.42 # Non-unit clause-clause subsumptions : 50
% 0.23/1.42 # Unit Clause-clause subsumption calls : 29
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 11
% 0.23/1.42 # BW rewrite match successes : 11
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 16207
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.016 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.018 s
% 0.23/1.42 # Maximum resident set size: 3324 pages
%------------------------------------------------------------------------------