TSTP Solution File: NUM306+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM306+1 : TPTP v8.2.0. Released v3.1.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 01:18:50 EDT 2024
% Result : Theorem 51.41s 6.99s
% Output : CNFRefutation 51.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 50 ( 32 unt; 0 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 116 ( 53 ~; 49 |; 10 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(add_rdn_rdn_rdn,axiom,
! [X21,X22,X31,X23,X28,X24,X29,X25,X26,X27,X32] :
( ( rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(X26))
& rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(X27))
& rdn_digit_add(rdnn(X26),rdnn(X27),rdnn(X32),rdnn(n0))
& rdn_add_with_carry(rdnn(X32),X31,X28,X29)
& rdn_non_zero(X31)
& rdn_non_zero(X28)
& rdn_non_zero(X29) )
=> rdn_add_with_carry(rdnn(X21),rdn(rdnn(X22),X31),rdn(rdnn(X23),X28),rdn(rdnn(X24),X29)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',add_rdn_rdn_rdn) ).
fof(sum_entry_point_pos_pos,axiom,
! [X1,X2,X3,X10,X11,X12] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X2,rdn_pos(X11))
& rdn_add_with_carry(rdnn(n0),X10,X11,X12)
& rdn_translate(X3,rdn_pos(X12)) )
=> sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',sum_entry_point_pos_pos) ).
fof(rdn_digit_add_n7_n0_n7_n0,axiom,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n7_n0_n7_n0) ).
fof(add_digit_digit_digit,axiom,
! [X21,X22,X23,X24,X25] :
( ( rdn_digit_add(rdnn(X22),rdnn(X23),rdnn(X25),rdnn(n0))
& rdn_digit_add(rdnn(X25),rdnn(X21),rdnn(X24),rdnn(n0)) )
=> rdn_add_with_carry(rdnn(X21),rdnn(X22),rdnn(X23),rdnn(X24)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',add_digit_digit_digit) ).
fof(rdn57,axiom,
rdn_translate(n57,rdn_pos(rdn(rdnn(n7),rdnn(n5)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn57) ).
fof(sum_n23_n34_n57,conjecture,
sum(n23,n34,n57),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_n23_n34_n57) ).
fof(rdn_digit_add_n3_n4_n7_n0,axiom,
rdn_digit_add(rdnn(n3),rdnn(n4),rdnn(n7),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n3_n4_n7_n0) ).
fof(rdn_digit_add_n5_n0_n5_n0,axiom,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n5_n0_n5_n0) ).
fof(rdn_non_zero_by_digit,axiom,
! [X1] :
( rdn_non_zero_digit(rdnn(X1))
=> rdn_non_zero(rdnn(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_non_zero_by_digit) ).
fof(rdn34,axiom,
rdn_translate(n34,rdn_pos(rdn(rdnn(n4),rdnn(n3)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn34) ).
fof(rdn_digit_add_n0_n0_n0_n0,axiom,
rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n0_n0_n0_n0) ).
fof(rdn_digit_add_n2_n3_n5_n0,axiom,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+2.ax',rdn_digit_add_n2_n3_n5_n0) ).
fof(rdn_digit5,axiom,
rdn_non_zero_digit(rdnn(n5)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_digit5) ).
fof(rdn_digit3,axiom,
rdn_non_zero_digit(rdnn(n3)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_digit3) ).
fof(rdn_digit2,axiom,
rdn_non_zero_digit(rdnn(n2)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_digit2) ).
fof(rdn23,axiom,
rdn_translate(n23,rdn_pos(rdn(rdnn(n3),rdnn(n2)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn23) ).
fof(c_0_16,plain,
! [X99,X100,X101,X102,X103,X104,X105,X106,X107,X108,X109] :
( ~ rdn_digit_add(rdnn(X100),rdnn(X102),rdnn(X106),rdnn(X107))
| ~ rdn_digit_add(rdnn(X106),rdnn(X99),rdnn(X104),rdnn(X108))
| ~ rdn_digit_add(rdnn(X107),rdnn(X108),rdnn(X109),rdnn(n0))
| ~ rdn_add_with_carry(rdnn(X109),X101,X103,X105)
| ~ rdn_non_zero(X101)
| ~ rdn_non_zero(X103)
| ~ rdn_non_zero(X105)
| rdn_add_with_carry(rdnn(X99),rdn(rdnn(X100),X101),rdn(rdnn(X102),X103),rdn(rdnn(X104),X105)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_rdn_rdn_rdn])])]) ).
fof(c_0_17,plain,
! [X33,X34,X35,X36,X37,X38] :
( ~ rdn_translate(X33,rdn_pos(X36))
| ~ rdn_translate(X34,rdn_pos(X37))
| ~ rdn_add_with_carry(rdnn(n0),X36,X37,X38)
| ~ rdn_translate(X35,rdn_pos(X38))
| sum(X33,X34,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_pos_pos])])]) ).
cnf(c_0_18,plain,
( rdn_add_with_carry(rdnn(X5),rdn(rdnn(X1),X9),rdn(rdnn(X2),X10),rdn(rdnn(X6),X11))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
| ~ rdn_digit_add(rdnn(X3),rdnn(X5),rdnn(X6),rdnn(X7))
| ~ rdn_digit_add(rdnn(X4),rdnn(X7),rdnn(X8),rdnn(n0))
| ~ rdn_add_with_carry(rdnn(X8),X9,X10,X11)
| ~ rdn_non_zero(X9)
| ~ rdn_non_zero(X10)
| ~ rdn_non_zero(X11) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
rdn_digit_add(rdnn(n7),rdnn(n0),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n7_n0_n7_n0]) ).
fof(c_0_20,plain,
! [X77,X78,X79,X80,X81] :
( ~ rdn_digit_add(rdnn(X78),rdnn(X79),rdnn(X81),rdnn(n0))
| ~ rdn_digit_add(rdnn(X81),rdnn(X77),rdnn(X80),rdnn(n0))
| rdn_add_with_carry(rdnn(X77),rdnn(X78),rdnn(X79),rdnn(X80)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[add_digit_digit_digit])])]) ).
cnf(c_0_21,plain,
( sum(X1,X3,X6)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_add_with_carry(rdnn(n0),X2,X4,X5)
| ~ rdn_translate(X6,rdn_pos(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
rdn_translate(n57,rdn_pos(rdn(rdnn(n7),rdnn(n5)))),
inference(split_conjunct,[status(thm)],[rdn57]) ).
fof(c_0_23,negated_conjecture,
~ sum(n23,n34,n57),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[sum_n23_n34_n57])]) ).
cnf(c_0_24,plain,
( rdn_add_with_carry(rdnn(n0),rdn(rdnn(X1),X2),rdn(rdnn(X3),X4),rdn(rdnn(n7),X5))
| ~ rdn_digit_add(rdnn(X6),rdnn(n0),rdnn(X7),rdnn(n0))
| ~ rdn_digit_add(rdnn(X1),rdnn(X3),rdnn(n7),rdnn(X6))
| ~ rdn_add_with_carry(rdnn(X7),X2,X4,X5)
| ~ rdn_non_zero(X5)
| ~ rdn_non_zero(X4)
| ~ rdn_non_zero(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
rdn_digit_add(rdnn(n3),rdnn(n4),rdnn(n7),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n3_n4_n7_n0]) ).
cnf(c_0_26,plain,
( rdn_add_with_carry(rdnn(X4),rdnn(X1),rdnn(X2),rdnn(X5))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(n0))
| ~ rdn_digit_add(rdnn(X3),rdnn(X4),rdnn(X5),rdnn(n0)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
rdn_digit_add(rdnn(n5),rdnn(n0),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n5_n0_n5_n0]) ).
fof(c_0_28,plain,
! [X137] :
( ~ rdn_non_zero_digit(rdnn(X137))
| rdn_non_zero(rdnn(X137)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_non_zero_by_digit])])]) ).
cnf(c_0_29,plain,
( sum(X1,X2,n57)
| ~ rdn_add_with_carry(rdnn(n0),X3,X4,rdn(rdnn(n7),rdnn(n5)))
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
rdn_translate(n34,rdn_pos(rdn(rdnn(n4),rdnn(n3)))),
inference(split_conjunct,[status(thm)],[rdn34]) ).
fof(c_0_31,negated_conjecture,
~ sum(n23,n34,n57),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( rdn_add_with_carry(rdnn(n0),rdn(rdnn(n3),X1),rdn(rdnn(n4),X2),rdn(rdnn(n7),X3))
| ~ rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(X4),rdnn(n0))
| ~ rdn_add_with_carry(rdnn(X4),X1,X2,X3)
| ~ rdn_non_zero(X3)
| ~ rdn_non_zero(X2)
| ~ rdn_non_zero(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
rdn_digit_add(rdnn(n0),rdnn(n0),rdnn(n0),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n0_n0_n0_n0]) ).
cnf(c_0_34,plain,
( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n5))
| ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n5),rdnn(n0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
rdn_digit_add(rdnn(n2),rdnn(n3),rdnn(n5),rdnn(n0)),
inference(split_conjunct,[status(thm)],[rdn_digit_add_n2_n3_n5_n0]) ).
cnf(c_0_36,plain,
( rdn_non_zero(rdnn(X1))
| ~ rdn_non_zero_digit(rdnn(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
rdn_non_zero_digit(rdnn(n5)),
inference(split_conjunct,[status(thm)],[rdn_digit5]) ).
cnf(c_0_38,plain,
rdn_non_zero_digit(rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_digit3]) ).
cnf(c_0_39,plain,
rdn_non_zero_digit(rdnn(n2)),
inference(split_conjunct,[status(thm)],[rdn_digit2]) ).
cnf(c_0_40,plain,
( sum(X1,n34,n57)
| ~ rdn_add_with_carry(rdnn(n0),X2,rdn(rdnn(n4),rdnn(n3)),rdn(rdnn(n7),rdnn(n5)))
| ~ rdn_translate(X1,rdn_pos(X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
rdn_translate(n23,rdn_pos(rdn(rdnn(n3),rdnn(n2)))),
inference(split_conjunct,[status(thm)],[rdn23]) ).
cnf(c_0_42,negated_conjecture,
~ sum(n23,n34,n57),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( rdn_add_with_carry(rdnn(n0),rdn(rdnn(n3),X1),rdn(rdnn(n4),X2),rdn(rdnn(n7),X3))
| ~ rdn_add_with_carry(rdnn(n0),X1,X2,X3)
| ~ rdn_non_zero(X3)
| ~ rdn_non_zero(X2)
| ~ rdn_non_zero(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_44,plain,
rdn_add_with_carry(rdnn(n0),rdnn(n2),rdnn(n3),rdnn(n5)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
rdn_non_zero(rdnn(n5)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,plain,
rdn_non_zero(rdnn(n3)),
inference(spm,[status(thm)],[c_0_36,c_0_38]) ).
cnf(c_0_47,plain,
rdn_non_zero(rdnn(n2)),
inference(spm,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_48,plain,
~ rdn_add_with_carry(rdnn(n0),rdn(rdnn(n3),rdnn(n2)),rdn(rdnn(n4),rdnn(n3)),rdn(rdnn(n7),rdnn(n5))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_49,plain,
$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_43,c_0_44]),c_0_45]),c_0_46]),c_0_47])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM306+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/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 : Mon May 20 04:09:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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
% 51.41/6.99 # Version: 3.1.0
% 51.41/6.99 # Preprocessing class: FSLMSMSLSSSNFFN.
% 51.41/6.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.41/6.99 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 51.41/6.99 # Starting new_bool_3 with 600s (2) cores
% 51.41/6.99 # Starting new_bool_1 with 600s (2) cores
% 51.41/6.99 # Starting sh5l with 300s (1) cores
% 51.41/6.99 # sh5l with pid 14751 completed with status 0
% 51.41/6.99 # Result found by sh5l
% 51.41/6.99 # Preprocessing class: FSLMSMSLSSSNFFN.
% 51.41/6.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.41/6.99 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 51.41/6.99 # Starting new_bool_3 with 600s (2) cores
% 51.41/6.99 # Starting new_bool_1 with 600s (2) cores
% 51.41/6.99 # Starting sh5l with 300s (1) cores
% 51.41/6.99 # SinE strategy is gf500_gu_R04_F100_L20000
% 51.41/6.99 # Search class: FGHSF-FFLM21-MFFFFFNN
% 51.41/6.99 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 51.41/6.99 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 51.41/6.99 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 51.41/6.99 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 14756 completed with status 0
% 51.41/6.99 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 51.41/6.99 # Preprocessing class: FSLMSMSLSSSNFFN.
% 51.41/6.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.41/6.99 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 51.41/6.99 # Starting new_bool_3 with 600s (2) cores
% 51.41/6.99 # Starting new_bool_1 with 600s (2) cores
% 51.41/6.99 # Starting sh5l with 300s (1) cores
% 51.41/6.99 # SinE strategy is gf500_gu_R04_F100_L20000
% 51.41/6.99 # Search class: FGHSF-FFLM21-MFFFFFNN
% 51.41/6.99 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 51.41/6.99 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 51.41/6.99 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 51.41/6.99 # Preprocessing time : 0.002 s
% 51.41/6.99 # Presaturation interreduction done
% 51.41/6.99
% 51.41/6.99 # Proof found!
% 51.41/6.99 # SZS status Theorem
% 51.41/6.99 # SZS output start CNFRefutation
% See solution above
% 51.41/6.99 # Parsed axioms : 402
% 51.41/6.99 # Removed by relevancy pruning/SinE : 244
% 51.41/6.99 # Initial clauses : 162
% 51.41/6.99 # Removed in clause preprocessing : 0
% 51.41/6.99 # Initial clauses in saturation : 162
% 51.41/6.99 # Processed clauses : 22505
% 51.41/6.99 # ...of these trivial : 0
% 51.41/6.99 # ...subsumed : 406
% 51.41/6.99 # ...remaining for further processing : 22099
% 51.41/6.99 # Other redundant clauses eliminated : 2
% 51.41/6.99 # Clauses deleted for lack of memory : 0
% 51.41/6.99 # Backward-subsumed : 0
% 51.41/6.99 # Backward-rewritten : 91
% 51.41/6.99 # Generated clauses : 364344
% 51.41/6.99 # ...of the previous two non-redundant : 362668
% 51.41/6.99 # ...aggressively subsumed : 0
% 51.41/6.99 # Contextual simplify-reflections : 0
% 51.41/6.99 # Paramodulations : 364340
% 51.41/6.99 # Factorizations : 2
% 51.41/6.99 # NegExts : 0
% 51.41/6.99 # Equation resolutions : 2
% 51.41/6.99 # Disequality decompositions : 0
% 51.41/6.99 # Total rewrite steps : 311355
% 51.41/6.99 # ...of those cached : 311115
% 51.41/6.99 # Propositional unsat checks : 0
% 51.41/6.99 # Propositional check models : 0
% 51.41/6.99 # Propositional check unsatisfiable : 0
% 51.41/6.99 # Propositional clauses : 0
% 51.41/6.99 # Propositional clauses after purity: 0
% 51.41/6.99 # Propositional unsat core size : 0
% 51.41/6.99 # Propositional preprocessing time : 0.000
% 51.41/6.99 # Propositional encoding time : 0.000
% 51.41/6.99 # Propositional solver time : 0.000
% 51.41/6.99 # Success case prop preproc time : 0.000
% 51.41/6.99 # Success case prop encoding time : 0.000
% 51.41/6.99 # Success case prop solver time : 0.000
% 51.41/6.99 # Current number of processed clauses : 21844
% 51.41/6.99 # Positive orientable unit clauses : 10009
% 51.41/6.99 # Positive unorientable unit clauses: 0
% 51.41/6.99 # Negative unit clauses : 128
% 51.41/6.99 # Non-unit-clauses : 11707
% 51.41/6.99 # Current number of unprocessed clauses: 339714
% 51.41/6.99 # ...number of literals in the above : 986343
% 51.41/6.99 # Current number of archived formulas : 0
% 51.41/6.99 # Current number of archived clauses : 253
% 51.41/6.99 # Clause-clause subsumption calls (NU) : 8309221
% 51.41/6.99 # Rec. Clause-clause subsumption calls : 3320408
% 51.41/6.99 # Non-unit clause-clause subsumptions : 406
% 51.41/6.99 # Unit Clause-clause subsumption calls : 852561
% 51.41/6.99 # Rewrite failures with RHS unbound : 0
% 51.41/6.99 # BW rewrite match attempts : 1131490
% 51.41/6.99 # BW rewrite match successes : 91
% 51.41/6.99 # Condensation attempts : 0
% 51.41/6.99 # Condensation successes : 0
% 51.41/6.99 # Termbank termtop insertions : 15310620
% 51.41/6.99 # Search garbage collected termcells : 1832
% 51.41/6.99
% 51.41/6.99 # -------------------------------------------------
% 51.41/6.99 # User time : 6.214 s
% 51.41/6.99 # System time : 0.230 s
% 51.41/6.99 # Total time : 6.444 s
% 51.41/6.99 # Maximum resident set size: 2784 pages
% 51.41/6.99
% 51.41/6.99 # -------------------------------------------------
% 51.41/6.99 # User time : 6.220 s
% 51.41/6.99 # System time : 0.234 s
% 51.41/6.99 # Total time : 6.454 s
% 51.41/6.99 # Maximum resident set size: 2056 pages
% 51.41/6.99 % E---3.1 exiting
%------------------------------------------------------------------------------