%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRA003+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:31:29 PM UTC 2026
% Result : Theorem 0.23s 0.51s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 12 unt; 0 def)
% Number of atoms : 226 ( 48 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 275 ( 96 ~; 86 |; 73 &)
% ( 4 <=>; 14 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 128 ( 20 sgn 80 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(vertices_and_edges,conjecture,
! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( path(X2,X3,X4)
& X7 != X8
& edge(X8)
& edge(X7)
& X2 != X3
& vertex(X3)
& vertex(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',vertices_and_edges) ).
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) )
& X2 != X3
& path(X2,X3,X10) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(precedes_properties,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( ( sequential(X7,X8)
<~> ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) ) )
& on_path(X8,X4)
& on_path(X7,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
fof(path_properties,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( ? [X1] :
( ( ( X4 = path_cons(X1,empty)
& X3 = head_of(X1) )
<~> ? [X5] :
( X4 = path_cons(X1,X5)
& path(head_of(X1),X3,X5) ) )
& X2 = tail_of(X1)
& edge(X1) )
& vertex(X3)
& vertex(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',path_properties) ).
fof(on_path_properties,axiom,
! [X2,X3,X4,X1] :
( ( on_path(X1,X4)
& path(X2,X3,X4) )
=> ( in_path(tail_of(X1),X4)
& in_path(head_of(X1),X4)
& edge(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( ~ precedes(X8,X7,X4)
& ~ ? [X9] :
( head_of(X9) = head_of(X8)
& tail_of(X9) = tail_of(X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(c_0_6,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( path(X2,X3,X4)
& X7 != X8
& edge(X8)
& edge(X7)
& X2 != X3
& vertex(X3)
& vertex(X2) ) ),
inference(assume_negation,[status(cth)],[vertices_and_edges]) ).
fof(c_0_7,plain,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) )
& X2 != X3
& path(X2,X3,X10) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_defn]) ).
fof(c_0_8,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( path(X2,X3,X4)
& X7 != X8
& edge(X8)
& edge(X7)
& X2 != X3
& vertex(X3)
& vertex(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( ~ ( sequential(X7,X8)
<=> ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) ) )
& on_path(X8,X4)
& on_path(X7,X4) ) ) ),
inference(fof_simplification,[status(thm)],[precedes_properties]) ).
fof(c_0_10,plain,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( ? [X1] :
( ~ ( ( X4 = path_cons(X1,empty)
& X3 = head_of(X1) )
<=> ? [X5] :
( X4 = path_cons(X1,X5)
& path(head_of(X1),X3,X5) ) )
& X2 = tail_of(X1)
& edge(X1) )
& vertex(X3)
& vertex(X2) ) ),
inference(fof_simplification,[status(thm)],[path_properties]) ).
fof(c_0_11,plain,
! [X64,X65,X66,X67,X68,X69,X70] :
( ( shortest_path(X68,X69,X70)
| X68 = X69
| ~ path(X68,X69,X70)
| ~ less_or_equal(length_of(X70),length_of(esk10_3(X68,X69,X70))) )
& ( shortest_path(X68,X69,X70)
| X68 = X69
| ~ path(X68,X69,X70)
| path(X68,X69,esk10_3(X68,X69,X70)) )
& ( ~ shortest_path(X64,X65,X66)
| less_or_equal(length_of(X66),length_of(X67))
| ~ path(X64,X65,X67) )
& ( ~ shortest_path(X64,X65,X66)
| X64 != X65 )
& ( ~ shortest_path(X64,X65,X66)
| path(X64,X65,X66) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])]) ).
fof(c_0_12,negated_conjecture,
( ( ~ path(esk1_0,esk2_0,esk5_0)
| esk3_0 = esk4_0
| ~ edge(esk4_0)
| ~ edge(esk3_0)
| esk1_0 = esk2_0
| ~ vertex(esk2_0)
| ~ vertex(esk1_0) )
& precedes(esk3_0,esk4_0,esk5_0)
& shortest_path(esk1_0,esk2_0,esk5_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_13,plain,
! [X24,X25,X26,X27,X28,X29] :
( ( ~ path(X25,X26,X24)
| ~ precedes(X27,X28,X24)
| sequential(X27,X28)
| precedes(esk6_3(X24,X27,X28),X28,X24) )
& ( ~ path(X25,X26,X24)
| ~ precedes(X27,X28,X24)
| sequential(X27,X28)
| sequential(X27,esk6_3(X24,X27,X28)) )
& ( ~ path(X25,X26,X24)
| ~ precedes(X27,X28,X24)
| ~ precedes(X29,X28,X24)
| ~ sequential(X27,X29)
| ~ sequential(X27,X28) )
& ( ~ path(X25,X26,X24)
| ~ precedes(X27,X28,X24)
| on_path(X28,X24) )
& ( ~ path(X25,X26,X24)
| ~ precedes(X27,X28,X24)
| on_path(X27,X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
fof(c_0_14,plain,
! [X38,X39,X40,X42] :
( ( ~ path(X38,X39,X40)
| X40 = path_cons(esk7_3(X38,X39,X40),empty)
| X40 = path_cons(esk7_3(X38,X39,X40),esk8_3(X38,X39,X40)) )
& ( ~ path(X38,X39,X40)
| X40 = path_cons(esk7_3(X38,X39,X40),empty)
| path(head_of(esk7_3(X38,X39,X40)),X39,esk8_3(X38,X39,X40)) )
& ( ~ path(X38,X39,X40)
| X39 = head_of(esk7_3(X38,X39,X40))
| X40 = path_cons(esk7_3(X38,X39,X40),esk8_3(X38,X39,X40)) )
& ( ~ path(X38,X39,X40)
| X39 = head_of(esk7_3(X38,X39,X40))
| path(head_of(esk7_3(X38,X39,X40)),X39,esk8_3(X38,X39,X40)) )
& ( ~ path(X38,X39,X40)
| X40 != path_cons(esk7_3(X38,X39,X40),X42)
| ~ path(head_of(esk7_3(X38,X39,X40)),X39,X42)
| X40 != path_cons(esk7_3(X38,X39,X40),empty)
| X39 != head_of(esk7_3(X38,X39,X40)) )
& ( ~ path(X38,X39,X40)
| X38 = tail_of(esk7_3(X38,X39,X40)) )
& ( ~ path(X38,X39,X40)
| edge(esk7_3(X38,X39,X40)) )
& ( ~ path(X38,X39,X40)
| vertex(X39) )
& ( ~ path(X38,X39,X40)
| vertex(X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])]) ).
cnf(c_0_15,plain,
( ~ shortest_path(X1,X2,X3)
| path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
shortest_path(esk1_0,esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X44,X45,X46,X47] :
( ( ~ on_path(X47,X46)
| ~ path(X44,X45,X46)
| in_path(tail_of(X47),X46) )
& ( ~ on_path(X47,X46)
| ~ path(X44,X45,X46)
| in_path(head_of(X47),X46) )
& ( ~ on_path(X47,X46)
| ~ path(X44,X45,X46)
| edge(X47) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])])]) ).
cnf(c_0_18,plain,
( ~ path(X4,X5,X2)
| ~ precedes(X3,X1,X2)
| on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
precedes(esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ path(X1,X2,X3)
| vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
path(esk1_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ path(X2,X1,X3)
| vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ on_path(X1,X4)
| ~ path(X2,X3,X4)
| edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( ~ path(X1,X2,esk5_0)
| on_path(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( ~ path(X4,X5,X2)
| ~ precedes(X1,X3,X2)
| on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
( ~ path(esk1_0,esk2_0,esk5_0)
| ~ edge(esk4_0)
| ~ edge(esk3_0)
| ~ vertex(esk2_0)
| ~ vertex(esk1_0)
| esk3_0 = esk4_0
| esk1_0 = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
vertex(esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
vertex(esk2_0),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( ~ on_path(X1,esk5_0)
| edge(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
on_path(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( ~ path(X1,X2,esk5_0)
| on_path(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
fof(c_0_32,plain,
! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( ~ precedes(X8,X7,X4)
& ~ ? [X9] :
( head_of(X9) = head_of(X8)
& tail_of(X9) = tail_of(X7) ) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_properties]) ).
cnf(c_0_33,negated_conjecture,
( ~ edge(esk4_0)
| ~ edge(esk3_0)
| esk2_0 = esk1_0
| esk3_0 = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_21])]) ).
cnf(c_0_34,negated_conjecture,
edge(esk4_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
on_path(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_31,c_0_21]) ).
fof(c_0_36,plain,
! [X58,X59,X60,X61,X62,X63] :
( ( ~ precedes(X60,X61,X62)
| ~ shortest_path(X58,X59,X62)
| ~ precedes(X61,X60,X62) )
& ( ~ precedes(X60,X61,X62)
| ~ shortest_path(X58,X59,X62)
| head_of(X63) != head_of(X61)
| tail_of(X63) != tail_of(X60) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ edge(esk3_0)
| esk3_0 = esk4_0
| esk2_0 = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
edge(esk3_0),
inference(spm,[status(thm)],[c_0_29,c_0_35]) ).
cnf(c_0_39,plain,
( ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( esk2_0 = esk1_0
| esk3_0 = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
( ~ precedes(X2,X1,esk5_0)
| ~ precedes(X1,X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_16]) ).
cnf(c_0_42,negated_conjecture,
( precedes(esk4_0,esk4_0,esk5_0)
| esk2_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_40]) ).
cnf(c_0_43,plain,
( ~ shortest_path(X1,X2,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,negated_conjecture,
esk2_0 = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_42]) ).
cnf(c_0_45,plain,
~ shortest_path(X1,X1,X2),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRA003+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n017.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 20 18:12:11 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.23/0.51 % Version: 3.5.1
% 0.23/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.51 % Starting sh5l with 300s (1) cores
% 0.23/0.51 % sh5l with pid 357109 completed with status 0
% 0.23/0.51 % Result found by sh5l
% 0.23/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.51 % Starting sh5l with 300s (1) cores
% 0.23/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.51 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.23/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.51 % SubtermCWHack with pid 357110 completed with status 0
% 0.23/0.51 % Result found by SubtermCWHack
% 0.23/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.51 % Starting sh5l with 300s (1) cores
% 0.23/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.51 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.23/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.23/0.51 % Preprocessing time : 0.001 s
% 0.23/0.51
% 0.23/0.51 % Proof found!
% 0.23/0.51 % SZS status Theorem
% 0.23/0.51 % SZS output start CNFRefutation
% See solution above
% 0.23/0.51 % Parsed axioms : 18
% 0.23/0.51 % Removed by relevancy pruning/SinE : 1
% 0.23/0.51 % Initial clauses : 56
% 0.23/0.51 % Removed in clause preprocessing : 0
% 0.23/0.51 % Initial clauses in saturation : 56
% 0.23/0.51 % Processed clauses : 60
% 0.23/0.51 % ...of these trivial : 0
% 0.23/0.51 % ...subsumed : 1
% 0.23/0.51 % ...remaining for further processing : 59
% 0.23/0.51 % Other redundant clauses eliminated : 6
% 0.23/0.51 % Clauses deleted for lack of memory : 0
% 0.23/0.51 % Backward-subsumed : 0
% 0.23/0.51 % Backward-rewritten : 9
% 0.23/0.51 % Generated clauses : 35
% 0.23/0.51 % ...of the previous two non-redundant : 33
% 0.23/0.51 % ...aggressively subsumed : 0
% 0.23/0.51 % Contextual simplify-reflections : 1
% 0.23/0.51 % Paramodulations : 31
% 0.23/0.51 % Factorizations : 0
% 0.23/0.51 % NegExts : 0
% 0.23/0.51 % Equation resolutions : 6
% 0.23/0.51 % Disequality decompositions : 0
% 0.23/0.51 % Total rewrite steps : 18
% 0.23/0.51 % ...of those cached : 9
% 0.23/0.51 % Propositional unsat checks : 0
% 0.23/0.51 % Propositional check models : 0
% 0.23/0.51 % Propositional check unsatisfiable : 0
% 0.23/0.51 % Propositional clauses : 0
% 0.23/0.51 % Propositional clauses after purity: 0
% 0.23/0.51 % Propositional unsat core size : 0
% 0.23/0.51 % Propositional preprocessing time : 0.000
% 0.23/0.51 % Propositional encoding time : 0.000
% 0.23/0.51 % Propositional solver time : 0.000
% 0.23/0.51 % Success case prop preproc time : 0.000
% 0.23/0.51 % Success case prop encoding time : 0.000
% 0.23/0.51 % Success case prop solver time : 0.000
% 0.23/0.51 % Current number of processed clauses : 47
% 0.23/0.51 % Positive orientable unit clauses : 10
% 0.23/0.51 % Positive unorientable unit clauses: 0
% 0.23/0.51 % Negative unit clauses : 3
% 0.23/0.51 % Non-unit-clauses : 34
% 0.23/0.51 % Current number of unprocessed clauses: 28
% 0.23/0.51 % ...number of literals in the above : 109
% 0.23/0.51 % Current number of archived formulas : 0
% 0.23/0.51 % Current number of archived clauses : 9
% 0.23/0.51 % Clause-clause subsumption calls (NU) : 208
% 0.23/0.51 % Rec. Clause-clause subsumption calls : 133
% 0.23/0.51 % Non-unit clause-clause subsumptions : 2
% 0.23/0.51 % Unit Clause-clause subsumption calls : 44
% 0.23/0.51 % Rewrite failures with RHS unbound : 0
% 0.23/0.51 % BW rewrite match attempts : 5
% 0.23/0.51 % BW rewrite match successes : 5
% 0.23/0.51 % Condensation attempts : 0
% 0.23/0.51 % Condensation successes : 0
% 0.23/0.51 % Termbank termtop insertions : 4559
% 0.23/0.51 % Search garbage collected termcells : 1109
% 0.23/0.51
% 0.23/0.51 % -------------------------------------------------
% 0.23/0.51 % User time : 0.006 s
% 0.23/0.51 % System time : 0.001 s
% 0.23/0.51 % Total time : 0.007 s
% 0.23/0.51 % Maximum resident set size: 3924 pages
% 0.23/0.51
% 0.23/0.51 % -------------------------------------------------
% 0.23/0.51 % User time : 0.006 s
% 0.23/0.51 % System time : 0.006 s
% 0.23/0.51 % Total time : 0.012 s
% 0.23/0.51 % Maximum resident set size: 4864 pages
% 0.23/0.51 % E exiting
%------------------------------------------------------------------------------