TSTP Solution File: PLA021-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PLA021-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Sat May 4 09:09:51 EDT 2024
% Result : Unsatisfiable 0.37s 0.54s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 23
% Syntax : Number of clauses : 75 ( 32 unt; 0 nHn; 69 RR)
% Number of literals : 173 ( 0 equ; 114 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 114 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_BD_CA,negated_conjecture,
~ holds(and(on(b,d),on(c,a)),X1),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',prove_BD_CA) ).
cnf(and_definition,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',and_definition) ).
cnf(putdown_4,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',putdown_4) ).
cnf(putdown_2,axiom,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',putdown_2) ).
cnf(pickup_1,axiom,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',pickup_1) ).
cnf(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',symmetry_of_differ) ).
cnf(differ_b_table,axiom,
differ(b,table),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',differ_b_table) ).
cnf(pickup_3,axiom,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',pickup_3) ).
cnf(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',differ_b_c) ).
cnf(pickup_4,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',pickup_4) ).
cnf(differ_b_d,axiom,
differ(b,d),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',differ_b_d) ).
cnf(putdown_1,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',putdown_1) ).
cnf(putdown_5,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',putdown_5) ).
cnf(differ_a_d,axiom,
differ(a,d),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',differ_a_d) ).
cnf(differ_a_b,axiom,
differ(a,b),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',differ_a_b) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',differ_c_table) ).
cnf(pickup_2,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',pickup_2) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',differ_a_c) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',initial_state3) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',initial_state7) ).
cnf(initial_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',initial_state6) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',initial_state5) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p',initial_state8) ).
cnf(c_0_23,negated_conjecture,
~ holds(and(on(b,d),on(c,a)),X1),
inference(fof_simplification,[status(thm)],[prove_BD_CA]) ).
cnf(c_0_24,plain,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
inference(fof_simplification,[status(thm)],[and_definition]) ).
cnf(c_0_25,negated_conjecture,
~ holds(and(on(b,d),on(c,a)),X1),
c_0_23 ).
cnf(c_0_26,plain,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
c_0_24 ).
cnf(c_0_27,plain,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
inference(fof_simplification,[status(thm)],[putdown_4]) ).
cnf(c_0_28,negated_conjecture,
( ~ holds(on(c,a),X1)
| ~ holds(on(b,d),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
c_0_27 ).
cnf(c_0_30,plain,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
inference(fof_simplification,[status(thm)],[putdown_2]) ).
cnf(c_0_31,negated_conjecture,
( ~ holds(on(b,d),do(putdown(X1,X2),X3))
| ~ holds(on(c,a),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_30 ).
cnf(c_0_33,plain,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
inference(fof_simplification,[status(thm)],[pickup_1]) ).
cnf(c_0_34,plain,
( differ(X1,X2)
| ~ differ(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).
cnf(c_0_35,negated_conjecture,
( ~ holds(on(c,a),X1)
| ~ holds(holding(b),X1)
| ~ holds(clear(d),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
c_0_33 ).
cnf(c_0_37,axiom,
differ(b,table),
differ_b_table ).
cnf(c_0_38,plain,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
inference(fof_simplification,[status(thm)],[pickup_3]) ).
cnf(c_0_39,plain,
( differ(X1,X2)
| ~ differ(X2,X1) ),
c_0_34 ).
cnf(c_0_40,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_41,negated_conjecture,
( ~ holds(on(c,a),do(pickup(b),X1))
| ~ holds(clear(d),do(pickup(b),X1))
| ~ holds(clear(b),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,plain,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
c_0_38 ).
cnf(c_0_43,plain,
differ(c,b),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
inference(fof_simplification,[status(thm)],[pickup_4]) ).
cnf(c_0_45,axiom,
differ(b,d),
differ_b_d ).
cnf(c_0_46,negated_conjecture,
( ~ holds(clear(d),do(pickup(b),X1))
| ~ holds(on(c,a),X1)
| ~ holds(clear(b),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_47,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
c_0_44 ).
cnf(c_0_48,plain,
differ(d,b),
inference(spm,[status(thm)],[c_0_39,c_0_45]) ).
cnf(c_0_49,plain,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
inference(fof_simplification,[status(thm)],[putdown_1]) ).
cnf(c_0_50,negated_conjecture,
( ~ holds(on(c,a),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(d),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_51,plain,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
c_0_49 ).
cnf(c_0_52,plain,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
inference(fof_simplification,[status(thm)],[putdown_5]) ).
cnf(c_0_53,axiom,
differ(a,d),
differ_a_d ).
cnf(c_0_54,negated_conjecture,
( ~ holds(clear(b),do(putdown(c,a),X1))
| ~ holds(clear(d),do(putdown(c,a),X1))
| ~ holds(holding(c),X1)
| ~ holds(clear(a),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_32]),c_0_51]) ).
cnf(c_0_55,plain,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
c_0_52 ).
cnf(c_0_56,plain,
differ(d,a),
inference(spm,[status(thm)],[c_0_39,c_0_53]) ).
cnf(c_0_57,axiom,
differ(a,b),
differ_a_b ).
cnf(c_0_58,negated_conjecture,
( ~ holds(clear(b),do(putdown(c,a),X1))
| ~ holds(holding(c),X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(d),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_59,plain,
differ(b,a),
inference(spm,[status(thm)],[c_0_39,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( ~ holds(holding(c),X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(d),X1)
| ~ holds(clear(b),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_55]),c_0_59])]) ).
cnf(c_0_61,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_62,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
inference(fof_simplification,[status(thm)],[pickup_2]) ).
cnf(c_0_63,negated_conjecture,
( ~ holds(clear(a),do(pickup(c),X1))
| ~ holds(clear(d),do(pickup(c),X1))
| ~ holds(clear(b),do(pickup(c),X1))
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_36]),c_0_61])]) ).
cnf(c_0_64,plain,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
c_0_62 ).
cnf(c_0_65,negated_conjecture,
( ~ holds(clear(a),do(pickup(c),X1))
| ~ holds(clear(b),do(pickup(c),X1))
| ~ holds(on(c,d),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( ~ holds(clear(a),do(pickup(c),X1))
| ~ holds(on(c,d),X1)
| ~ holds(clear(c),X1)
| ~ holds(clear(b),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_47]),c_0_40])]) ).
cnf(c_0_67,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_68,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(clear(c),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(a),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_47]),c_0_67])]) ).
cnf(c_0_69,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_70,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_71,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_72,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_73,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_74,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_68,c_0_69]),c_0_70]),c_0_71]),c_0_72]),c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : PLA021-1 : TPTP v8.1.2. Released v1.1.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n008.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 11:45:27 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 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/tmp/tmp.i5JXXCbZ2O/E---3.1_9487.p
% 0.37/0.54 # Version: 3.1.0
% 0.37/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.54 # Starting sh5l with 300s (1) cores
% 0.37/0.54 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9564 completed with status 0
% 0.37/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.54 # No SInE strategy applied
% 0.37/0.54 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.37/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.37/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.37/0.54 # Starting new_bool_1 with 136s (1) cores
% 0.37/0.54 # Starting sh5l with 136s (1) cores
% 0.37/0.54 # SAT001_MinMin_p005000_rr_RG with pid 9568 completed with status 0
% 0.37/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.37/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.54 # No SInE strategy applied
% 0.37/0.54 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.37/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.37/0.54 # Preprocessing time : 0.001 s
% 0.37/0.54 # Presaturation interreduction done
% 0.37/0.54
% 0.37/0.54 # Proof found!
% 0.37/0.54 # SZS status Unsatisfiable
% 0.37/0.54 # SZS output start CNFRefutation
% See solution above
% 0.37/0.54 # Parsed axioms : 31
% 0.37/0.54 # Removed by relevancy pruning/SinE : 0
% 0.37/0.54 # Initial clauses : 31
% 0.37/0.54 # Removed in clause preprocessing : 0
% 0.37/0.54 # Initial clauses in saturation : 31
% 0.37/0.54 # Processed clauses : 114
% 0.37/0.54 # ...of these trivial : 0
% 0.37/0.54 # ...subsumed : 5
% 0.37/0.54 # ...remaining for further processing : 109
% 0.37/0.54 # Other redundant clauses eliminated : 0
% 0.37/0.54 # Clauses deleted for lack of memory : 0
% 0.37/0.54 # Backward-subsumed : 1
% 0.37/0.54 # Backward-rewritten : 0
% 0.37/0.54 # Generated clauses : 92
% 0.37/0.54 # ...of the previous two non-redundant : 78
% 0.37/0.54 # ...aggressively subsumed : 0
% 0.37/0.54 # Contextual simplify-reflections : 2
% 0.37/0.54 # Paramodulations : 92
% 0.37/0.54 # Factorizations : 0
% 0.37/0.54 # NegExts : 0
% 0.37/0.54 # Equation resolutions : 0
% 0.37/0.54 # Disequality decompositions : 0
% 0.37/0.54 # Total rewrite steps : 41
% 0.37/0.54 # ...of those cached : 22
% 0.37/0.54 # Propositional unsat checks : 0
% 0.37/0.54 # Propositional check models : 0
% 0.37/0.54 # Propositional check unsatisfiable : 0
% 0.37/0.54 # Propositional clauses : 0
% 0.37/0.54 # Propositional clauses after purity: 0
% 0.37/0.54 # Propositional unsat core size : 0
% 0.37/0.54 # Propositional preprocessing time : 0.000
% 0.37/0.54 # Propositional encoding time : 0.000
% 0.37/0.54 # Propositional solver time : 0.000
% 0.37/0.54 # Success case prop preproc time : 0.000
% 0.37/0.54 # Success case prop encoding time : 0.000
% 0.37/0.54 # Success case prop solver time : 0.000
% 0.37/0.54 # Current number of processed clauses : 77
% 0.37/0.54 # Positive orientable unit clauses : 29
% 0.37/0.54 # Positive unorientable unit clauses: 0
% 0.37/0.54 # Negative unit clauses : 3
% 0.37/0.54 # Non-unit-clauses : 45
% 0.37/0.54 # Current number of unprocessed clauses: 26
% 0.37/0.54 # ...number of literals in the above : 147
% 0.37/0.54 # Current number of archived formulas : 0
% 0.37/0.54 # Current number of archived clauses : 32
% 0.37/0.54 # Clause-clause subsumption calls (NU) : 1204
% 0.37/0.54 # Rec. Clause-clause subsumption calls : 121
% 0.37/0.54 # Non-unit clause-clause subsumptions : 7
% 0.37/0.54 # Unit Clause-clause subsumption calls : 52
% 0.37/0.54 # Rewrite failures with RHS unbound : 0
% 0.37/0.54 # BW rewrite match attempts : 0
% 0.37/0.54 # BW rewrite match successes : 0
% 0.37/0.54 # Condensation attempts : 0
% 0.37/0.54 # Condensation successes : 0
% 0.37/0.54 # Termbank termtop insertions : 3656
% 0.37/0.54 # Search garbage collected termcells : 55
% 0.37/0.54
% 0.37/0.54 # -------------------------------------------------
% 0.37/0.54 # User time : 0.007 s
% 0.37/0.54 # System time : 0.003 s
% 0.37/0.54 # Total time : 0.010 s
% 0.37/0.54 # Maximum resident set size: 1676 pages
% 0.37/0.54
% 0.37/0.54 # -------------------------------------------------
% 0.37/0.54 # User time : 0.036 s
% 0.37/0.54 # System time : 0.006 s
% 0.37/0.54 # Total time : 0.042 s
% 0.37/0.54 # Maximum resident set size: 1712 pages
% 0.37/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------