TSTP Solution File: PLA018-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PLA018-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:09:52 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 26
% Syntax : Number of clauses : 76 ( 34 unt; 0 nHn; 70 RR)
% Number of literals : 188 ( 0 equ; 134 neg)
% Maximal clause size : 6 ( 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 : 104 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_AB_DC,negated_conjecture,
~ holds(and(on(a,b),on(d,c)),X1),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',prove_AB_DC) ).
cnf(and_definition,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',and_definition) ).
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.lN0NjItsBP/E---3.1_29161.p',putdown_2) ).
cnf(putdown_4,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',putdown_4) ).
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.lN0NjItsBP/E---3.1_29161.p',pickup_1) ).
cnf(differ_d_table,axiom,
differ(d,table),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_d_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.lN0NjItsBP/E---3.1_29161.p',pickup_3) ).
cnf(differ_a_d,axiom,
differ(a,d),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_a_d) ).
cnf(pickup_4,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',pickup_4) ).
cnf(differ_c_d,axiom,
differ(c,d),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_c_d) ).
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.lN0NjItsBP/E---3.1_29161.p',putdown_5) ).
cnf(putdown_3,axiom,
( holds(clear(X1),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',putdown_3) ).
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.lN0NjItsBP/E---3.1_29161.p',putdown_1) ).
cnf(differ_c_table,axiom,
differ(c,table),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_c_table) ).
cnf(differ_a_c,axiom,
differ(a,c),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_a_c) ).
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.lN0NjItsBP/E---3.1_29161.p',pickup_2) ).
cnf(clear_table,axiom,
holds(clear(table),X1),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',clear_table) ).
cnf(symmetry_of_differ,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',symmetry_of_differ) ).
cnf(differ_b_c,axiom,
differ(b,c),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_b_c) ).
cnf(differ_a_table,axiom,
differ(a,table),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_a_table) ).
cnf(differ_a_b,axiom,
differ(a,b),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',differ_a_b) ).
cnf(initial_state3,axiom,
holds(on(c,d),s0),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',initial_state3) ).
cnf(initial_state5,axiom,
holds(clear(a),s0),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',initial_state5) ).
cnf(initial_state7,axiom,
holds(clear(c),s0),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',initial_state7) ).
cnf(initial_state6,axiom,
holds(clear(b),s0),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',initial_state6) ).
cnf(initial_state8,axiom,
holds(empty,s0),
file('/export/starexec/sandbox/tmp/tmp.lN0NjItsBP/E---3.1_29161.p',initial_state8) ).
cnf(c_0_26,negated_conjecture,
~ holds(and(on(a,b),on(d,c)),X1),
prove_AB_DC ).
cnf(c_0_27,axiom,
( holds(and(X1,X2),X3)
| ~ holds(X1,X3)
| ~ holds(X2,X3) ),
and_definition ).
cnf(c_0_28,negated_conjecture,
( ~ holds(on(d,c),X1)
| ~ holds(on(a,b),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,axiom,
( holds(on(X1,X2),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_2 ).
cnf(c_0_30,negated_conjecture,
( ~ holds(on(a,b),do(putdown(d,c),X1))
| ~ holds(holding(d),X1)
| ~ holds(clear(c),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,axiom,
( holds(on(X1,X2),do(putdown(X3,X4),X5))
| ~ holds(on(X1,X2),X5) ),
putdown_4 ).
cnf(c_0_32,negated_conjecture,
( ~ holds(on(a,b),X1)
| ~ holds(holding(d),X1)
| ~ holds(clear(c),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,axiom,
( holds(holding(X1),do(pickup(X1),X2))
| ~ holds(empty,X2)
| ~ holds(clear(X1),X2)
| ~ differ(X1,table) ),
pickup_1 ).
cnf(c_0_34,axiom,
differ(d,table),
differ_d_table ).
cnf(c_0_35,negated_conjecture,
( ~ holds(on(a,b),do(pickup(d),X1))
| ~ holds(clear(c),do(pickup(d),X1))
| ~ holds(clear(d),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,axiom,
( holds(on(X1,X2),do(pickup(X3),X4))
| ~ holds(on(X1,X2),X4)
| ~ differ(X1,X3) ),
pickup_3 ).
cnf(c_0_37,axiom,
differ(a,d),
differ_a_d ).
cnf(c_0_38,negated_conjecture,
( ~ holds(clear(c),do(pickup(d),X1))
| ~ holds(on(a,b),X1)
| ~ holds(clear(d),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_39,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(clear(X1),X3)
| ~ differ(X1,X2) ),
pickup_4 ).
cnf(c_0_40,axiom,
differ(c,d),
differ_c_d ).
cnf(c_0_41,negated_conjecture,
( ~ holds(on(a,b),X1)
| ~ holds(clear(d),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
( ~ holds(clear(d),do(putdown(X1,X2),X3))
| ~ holds(clear(c),do(putdown(X1,X2),X3))
| ~ holds(empty,do(putdown(X1,X2),X3))
| ~ holds(on(a,b),X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_31]) ).
cnf(c_0_43,axiom,
( holds(clear(X1),do(putdown(X2,X3),X4))
| ~ holds(clear(X1),X4)
| ~ differ(X1,X3) ),
putdown_5 ).
cnf(c_0_44,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(c),do(putdown(X2,X1),X3))
| ~ holds(empty,do(putdown(X2,X1),X3))
| ~ holds(on(a,b),X3)
| ~ holds(clear(d),X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,axiom,
( holds(clear(X1),do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_3 ).
cnf(c_0_46,axiom,
( holds(empty,do(putdown(X1,X2),X3))
| ~ holds(holding(X1),X3)
| ~ holds(clear(X2),X3) ),
putdown_1 ).
cnf(c_0_47,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(on(a,b),X2)
| ~ holds(clear(d),X2)
| ~ holds(holding(c),X2)
| ~ holds(clear(X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_48,axiom,
differ(c,table),
differ_c_table ).
cnf(c_0_49,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(on(a,b),do(pickup(c),X2))
| ~ holds(clear(d),do(pickup(c),X2))
| ~ holds(clear(X1),do(pickup(c),X2))
| ~ holds(clear(c),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_48])]) ).
cnf(c_0_50,axiom,
differ(a,c),
differ_a_c ).
cnf(c_0_51,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(d),do(pickup(c),X2))
| ~ holds(clear(X1),do(pickup(c),X2))
| ~ holds(on(a,b),X2)
| ~ holds(clear(c),X2)
| ~ holds(empty,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_36]),c_0_50])]) ).
cnf(c_0_52,axiom,
( holds(clear(X1),do(pickup(X2),X3))
| ~ holds(on(X2,X1),X3)
| ~ holds(clear(X2),X3)
| ~ holds(empty,X3) ),
pickup_2 ).
cnf(c_0_53,negated_conjecture,
( ~ differ(d,X1)
| ~ holds(clear(X1),do(pickup(c),X2))
| ~ holds(on(a,b),X2)
| ~ holds(on(c,d),X2)
| ~ holds(clear(c),X2)
| ~ holds(empty,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,axiom,
holds(clear(table),X1),
clear_table ).
cnf(c_0_55,negated_conjecture,
( ~ holds(on(a,b),X1)
| ~ holds(on(c,d),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_34])]) ).
cnf(c_0_56,negated_conjecture,
( ~ holds(on(a,b),do(putdown(X1,X2),X3))
| ~ holds(clear(c),do(putdown(X1,X2),X3))
| ~ holds(empty,do(putdown(X1,X2),X3))
| ~ holds(on(c,d),X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_31]) ).
cnf(c_0_57,axiom,
( differ(X1,X2)
| ~ differ(X2,X1) ),
symmetry_of_differ ).
cnf(c_0_58,axiom,
differ(b,c),
differ_b_c ).
cnf(c_0_59,negated_conjecture,
( ~ holds(clear(c),do(putdown(a,b),X1))
| ~ holds(on(c,d),X1)
| ~ holds(holding(a),X1)
| ~ holds(clear(b),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_29]),c_0_46]) ).
cnf(c_0_60,plain,
differ(c,b),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(holding(a),X1)
| ~ holds(clear(b),X1)
| ~ holds(clear(c),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_43]),c_0_60])]) ).
cnf(c_0_62,axiom,
differ(a,table),
differ_a_table ).
cnf(c_0_63,negated_conjecture,
( ~ holds(on(c,d),do(pickup(a),X1))
| ~ holds(clear(b),do(pickup(a),X1))
| ~ holds(clear(c),do(pickup(a),X1))
| ~ holds(clear(a),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_33]),c_0_62])]) ).
cnf(c_0_64,plain,
differ(c,a),
inference(spm,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_65,negated_conjecture,
( ~ holds(clear(b),do(pickup(a),X1))
| ~ holds(clear(c),do(pickup(a),X1))
| ~ holds(on(c,d),X1)
| ~ holds(clear(a),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_36]),c_0_64])]) ).
cnf(c_0_66,axiom,
differ(a,b),
differ_a_b ).
cnf(c_0_67,negated_conjecture,
( ~ holds(clear(b),do(pickup(a),X1))
| ~ holds(on(c,d),X1)
| ~ holds(clear(a),X1)
| ~ holds(clear(c),X1)
| ~ holds(empty,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_39]),c_0_64])]) ).
cnf(c_0_68,plain,
differ(b,a),
inference(spm,[status(thm)],[c_0_57,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( ~ holds(on(c,d),X1)
| ~ holds(clear(a),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_67,c_0_39]),c_0_68])]) ).
cnf(c_0_70,axiom,
holds(on(c,d),s0),
initial_state3 ).
cnf(c_0_71,axiom,
holds(clear(a),s0),
initial_state5 ).
cnf(c_0_72,axiom,
holds(clear(c),s0),
initial_state7 ).
cnf(c_0_73,axiom,
holds(clear(b),s0),
initial_state6 ).
cnf(c_0_74,axiom,
holds(empty,s0),
initial_state8 ).
cnf(c_0_75,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_69,c_0_70]),c_0_71]),c_0_72]),c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : PLA018-1 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n010.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 : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 20:03:35 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.lN0NjItsBP/E---3.1_29161.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # sh5l with pid 29242 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 29247 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 31
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 31
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 31
% 0.21/0.50 # Processed clauses : 163
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 10
% 0.21/0.50 # ...remaining for further processing : 153
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 1
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 171
% 0.21/0.50 # ...of the previous two non-redundant : 157
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 8
% 0.21/0.50 # Paramodulations : 171
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 53
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 121
% 0.21/0.50 # Positive orientable unit clauses : 29
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 90
% 0.21/0.50 # Current number of unprocessed clauses: 54
% 0.21/0.50 # ...number of literals in the above : 324
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 32
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 5301
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 247
% 0.21/0.50 # Non-unit clause-clause subsumptions : 19
% 0.21/0.50 # Unit Clause-clause subsumption calls : 58
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 7054
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.013 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.014 s
% 0.21/0.50 # Maximum resident set size: 1628 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.013 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.017 s
% 0.21/0.50 # Maximum resident set size: 1732 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------