TSTP Solution File: SWW436-1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW436-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Mon Jun 24 18:11:59 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of clauses : 32 ( 21 unt; 11 nHn; 28 RR)
% Number of literals : 47 ( 32 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 18 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 14 con; 0-2 aty)
% Number of variables : 27 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
file('/export/starexec/sandbox/tmp/tmp.nZ9gtXvsVO/E---3.1_8550.p',wellformedness_5) ).
cnf(premise_9,hypothesis,
heap(sep(lseg(x13,x2),sep(lseg(x4,x9),sep(lseg(x4,x13),sep(lseg(x1,x5),sep(lseg(x1,x6),sep(lseg(x8,x14),sep(lseg(x8,x15),sep(lseg(x8,x1),sep(lseg(x14,x8),sep(lseg(x15,x4),sep(lseg(x2,x15),sep(lseg(x2,x9),sep(lseg(x9,x7),sep(lseg(x9,x6),sep(lseg(x3,x10),sep(lseg(x6,x2),emp))))))))))))))))),
file('/export/starexec/sandbox/tmp/tmp.nZ9gtXvsVO/E---3.1_8550.p',premise_9) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.nZ9gtXvsVO/E---3.1_8550.p',associative_commutative) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.nZ9gtXvsVO/E---3.1_8550.p',normalization) ).
cnf(premise_4,hypothesis,
x4 != x6,
file('/export/starexec/sandbox/tmp/tmp.nZ9gtXvsVO/E---3.1_8550.p',premise_4) ).
cnf(premise_5,hypothesis,
x4 != x7,
file('/export/starexec/sandbox/tmp/tmp.nZ9gtXvsVO/E---3.1_8550.p',premise_5) ).
cnf(c_0_6,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
inference(fof_simplification,[status(thm)],[wellformedness_5]) ).
cnf(c_0_7,hypothesis,
heap(sep(lseg(x13,x2),sep(lseg(x4,x9),sep(lseg(x4,x13),sep(lseg(x1,x5),sep(lseg(x1,x6),sep(lseg(x8,x14),sep(lseg(x8,x15),sep(lseg(x8,x1),sep(lseg(x14,x8),sep(lseg(x15,x4),sep(lseg(x2,x15),sep(lseg(x2,x9),sep(lseg(x9,x7),sep(lseg(x9,x6),sep(lseg(x3,x10),sep(lseg(x6,x2),emp))))))))))))))))),
premise_9 ).
cnf(c_0_8,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_9,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
c_0_6 ).
cnf(c_0_10,hypothesis,
heap(sep(lseg(x4,x9),sep(lseg(x4,x13),sep(lseg(x6,x2),sep(lseg(x2,x9),sep(lseg(x2,x15),sep(lseg(x9,x6),sep(lseg(x9,x7),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x1),sep(lseg(x8,x15),sep(lseg(x8,x14),sep(lseg(x15,x4),sep(lseg(x3,x10),sep(lseg(x13,x2),sep(lseg(x14,x8),emp))))))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_11,hypothesis,
( x9 = x4
| x13 = x4 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_13,hypothesis,
( x9 = x4
| heap(sep(lseg(x4,x9),sep(lseg(x6,x2),sep(lseg(x2,x9),sep(lseg(x2,x15),sep(lseg(x9,x6),sep(lseg(x9,x7),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x1),sep(lseg(x8,x15),sep(lseg(x8,x14),sep(lseg(x15,x4),sep(lseg(x3,x10),sep(lseg(x4,x2),sep(lseg(x14,x8),emp)))))))))))))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,hypothesis,
( x9 = x4
| heap(sep(lseg(x4,x2),sep(lseg(x4,x9),sep(lseg(x6,x2),sep(lseg(x2,x9),sep(lseg(x2,x15),sep(lseg(x9,x6),sep(lseg(x9,x7),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x1),sep(lseg(x8,x15),sep(lseg(x8,x14),sep(lseg(x15,x4),sep(lseg(x3,x10),sep(lseg(x14,x8),emp)))))))))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_13,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_15,hypothesis,
( x2 = x4
| x9 = x4 ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_16,hypothesis,
x4 != x6,
inference(fof_simplification,[status(thm)],[premise_4]) ).
cnf(c_0_17,hypothesis,
( x2 = x4
| heap(sep(lseg(x4,x6),sep(lseg(x4,x13),sep(lseg(x4,x7),sep(lseg(x6,x2),sep(lseg(x2,x4),sep(lseg(x2,x15),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x1),sep(lseg(x8,x15),sep(lseg(x8,x14),sep(lseg(x15,x4),sep(lseg(x3,x10),sep(lseg(x13,x2),sep(lseg(x14,x8),emp)))))))))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_10,c_0_15]),c_0_12]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_18,hypothesis,
x4 != x6,
c_0_16 ).
cnf(c_0_19,hypothesis,
( x2 = x4
| x13 = x4 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_18]) ).
cnf(c_0_20,hypothesis,
( x2 = x4
| heap(sep(lseg(x4,x6),sep(lseg(x4,x2),sep(lseg(x4,x7),sep(lseg(x6,x2),sep(lseg(x2,x4),sep(lseg(x2,x15),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x1),sep(lseg(x8,x15),sep(lseg(x8,x14),sep(lseg(x15,x4),sep(lseg(x3,x10),sep(lseg(x14,x8),emp))))))))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_17,c_0_19]),c_0_12]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_21,hypothesis,
x2 = x4,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_18]) ).
cnf(c_0_22,hypothesis,
heap(sep(lseg(x4,x9),sep(lseg(x4,x9),sep(lseg(x4,x15),sep(lseg(x4,x13),sep(lseg(x6,x4),sep(lseg(x9,x6),sep(lseg(x9,x7),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x1),sep(lseg(x8,x15),sep(lseg(x8,x14),sep(lseg(x15,x4),sep(lseg(x3,x10),sep(lseg(x13,x4),sep(lseg(x14,x8),emp))))))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_21]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_23,hypothesis,
x9 = x4,
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_24,hypothesis,
heap(sep(lseg(x4,x6),sep(lseg(x4,x15),sep(lseg(x4,x13),sep(lseg(x4,x7),sep(lseg(x6,x4),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x1),sep(lseg(x8,x15),sep(lseg(x8,x14),sep(lseg(x15,x4),sep(lseg(x3,x10),sep(lseg(x13,x4),sep(lseg(x14,x8),emp))))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_10,c_0_23]),c_0_12]),c_0_21]),c_0_21]),c_0_8]),c_0_8]),c_0_21]),c_0_21]),c_0_12]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_25,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(X4,sep(lseg(X1,X3),X5)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_26,hypothesis,
x15 = x4,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_24]),c_0_18]) ).
cnf(c_0_27,hypothesis,
x13 = x4,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_18]) ).
cnf(c_0_28,hypothesis,
x4 != x7,
inference(fof_simplification,[status(thm)],[premise_5]) ).
cnf(c_0_29,hypothesis,
heap(sep(lseg(x4,x6),sep(lseg(x4,x7),sep(lseg(x6,x4),sep(lseg(x1,x6),sep(lseg(x1,x5),sep(lseg(x8,x4),sep(lseg(x8,x1),sep(lseg(x8,x14),sep(lseg(x3,x10),sep(lseg(x14,x8),emp))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_10,c_0_26]),c_0_23]),c_0_21]),c_0_21]),c_0_23]),c_0_21]),c_0_23]),c_0_23]),c_0_21]),c_0_12]),c_0_12]),c_0_12]),c_0_12]),c_0_27]),c_0_27]),c_0_12]),c_0_8]),c_0_8]),c_0_8]),c_0_12]) ).
cnf(c_0_30,hypothesis,
x4 != x7,
c_0_28 ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_29]),c_0_30]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWW436-1 : TPTP v8.2.0. Released v5.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 07:13:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.nZ9gtXvsVO/E---3.1_8550.p
% 0.21/0.52 # Version: 3.2.0
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 8668 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.21/0.52 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.21/0.52 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 8675 completed with status 0
% 0.21/0.52 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.21/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.21/0.52 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 21
% 0.21/0.52 # Removed by relevancy pruning/SinE : 7
% 0.21/0.52 # Initial clauses : 14
% 0.21/0.52 # Removed in clause preprocessing : 1
% 0.21/0.52 # Initial clauses in saturation : 13
% 0.21/0.52 # Processed clauses : 81
% 0.21/0.52 # ...of these trivial : 2
% 0.21/0.52 # ...subsumed : 26
% 0.21/0.52 # ...remaining for further processing : 53
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 16
% 0.21/0.52 # Generated clauses : 161
% 0.21/0.52 # ...of the previous two non-redundant : 150
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 161
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 405
% 0.21/0.52 # ...of those cached : 242
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 24
% 0.21/0.52 # Positive orientable unit clauses : 9
% 0.21/0.52 # Positive unorientable unit clauses: 2
% 0.21/0.52 # Negative unit clauses : 8
% 0.21/0.52 # Non-unit-clauses : 5
% 0.21/0.52 # Current number of unprocessed clauses: 85
% 0.21/0.52 # ...number of literals in the above : 193
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 29
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 46
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 46
% 0.21/0.52 # Non-unit clause-clause subsumptions : 19
% 0.21/0.52 # Unit Clause-clause subsumption calls : 75
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 49
% 0.21/0.52 # BW rewrite match successes : 22
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 5224
% 0.21/0.52 # Search garbage collected termcells : 74
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.015 s
% 0.21/0.52 # Maximum resident set size: 1776 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.012 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.018 s
% 0.21/0.52 # Maximum resident set size: 1732 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------