TSTP Solution File: GRA003+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRA003+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 17:35:53 EDT 2023
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 13 unt; 0 def)
% Number of atoms : 213 ( 45 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 261 ( 94 ~; 86 |; 64 &)
% ( 3 <=>; 12 =>; 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 : 119 ( 20 sgn; 71 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(vertices_and_edges,conjecture,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( vertex(X2)
& vertex(X3)
& X2 != X3
& edge(X7)
& edge(X8)
& X7 != X8
& path(X2,X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.MmZXYN4Dno/E---3.1_9721.p',vertices_and_edges) ).
fof(precedes_properties,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
<~> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MmZXYN4Dno/E---3.1_9721.p',precedes_properties) ).
fof(path_properties,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
<~> ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MmZXYN4Dno/E---3.1_9721.p',path_properties) ).
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MmZXYN4Dno/E---3.1_9721.p',shortest_path_defn) ).
fof(on_path_properties,axiom,
! [X2,X3,X4,X1] :
( ( path(X2,X3,X4)
& on_path(X1,X4) )
=> ( edge(X1)
& in_path(head_of(X1),X4)
& in_path(tail_of(X1),X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.MmZXYN4Dno/E---3.1_9721.p',on_path_properties) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.MmZXYN4Dno/E---3.1_9721.p',shortest_path_properties) ).
fof(c_0_6,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( vertex(X2)
& vertex(X3)
& X2 != X3
& edge(X7)
& edge(X8)
& X7 != X8
& path(X2,X3,X4) ) ),
inference(assume_negation,[status(cth)],[vertices_and_edges]) ).
fof(c_0_7,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ~ ( sequential(X7,X8)
<=> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[precedes_properties]) ).
fof(c_0_8,plain,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ~ ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
<=> ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[path_properties]) ).
fof(c_0_9,plain,
! [X64,X65,X66,X67,X68,X69,X70] :
( ( path(X64,X65,X66)
| ~ shortest_path(X64,X65,X66) )
& ( X64 != X65
| ~ shortest_path(X64,X65,X66) )
& ( ~ path(X64,X65,X67)
| less_or_equal(length_of(X66),length_of(X67))
| ~ shortest_path(X64,X65,X66) )
& ( path(X68,X69,esk10_3(X68,X69,X70))
| ~ path(X68,X69,X70)
| X68 = X69
| shortest_path(X68,X69,X70) )
& ( ~ less_or_equal(length_of(X70),length_of(esk10_3(X68,X69,X70)))
| ~ path(X68,X69,X70)
| X68 = X69
| shortest_path(X68,X69,X70) ) ),
inference(distribute,[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)],[shortest_path_defn])])])])])]) ).
fof(c_0_10,negated_conjecture,
( shortest_path(esk1_0,esk2_0,esk5_0)
& precedes(esk3_0,esk4_0,esk5_0)
& ( ~ vertex(esk1_0)
| ~ vertex(esk2_0)
| esk1_0 = esk2_0
| ~ edge(esk3_0)
| ~ edge(esk4_0)
| esk3_0 = esk4_0
| ~ path(esk1_0,esk2_0,esk5_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,plain,
! [X24,X25,X26,X27,X28,X29] :
( ( on_path(X27,X24)
| ~ precedes(X27,X28,X24)
| ~ path(X25,X26,X24) )
& ( on_path(X28,X24)
| ~ precedes(X27,X28,X24)
| ~ path(X25,X26,X24) )
& ( ~ sequential(X27,X28)
| ~ sequential(X27,X29)
| ~ precedes(X29,X28,X24)
| ~ precedes(X27,X28,X24)
| ~ path(X25,X26,X24) )
& ( sequential(X27,esk6_3(X24,X27,X28))
| sequential(X27,X28)
| ~ precedes(X27,X28,X24)
| ~ path(X25,X26,X24) )
& ( precedes(esk6_3(X24,X27,X28),X28,X24)
| sequential(X27,X28)
| ~ precedes(X27,X28,X24)
| ~ path(X25,X26,X24) ) ),
inference(distribute,[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,plain,
! [X38,X39,X40,X42] :
( ( vertex(X38)
| ~ path(X38,X39,X40) )
& ( vertex(X39)
| ~ path(X38,X39,X40) )
& ( edge(esk7_3(X38,X39,X40))
| ~ path(X38,X39,X40) )
& ( X38 = tail_of(esk7_3(X38,X39,X40))
| ~ path(X38,X39,X40) )
& ( X39 != head_of(esk7_3(X38,X39,X40))
| X40 != path_cons(esk7_3(X38,X39,X40),empty)
| ~ path(head_of(esk7_3(X38,X39,X40)),X39,X42)
| X40 != path_cons(esk7_3(X38,X39,X40),X42)
| ~ path(X38,X39,X40) )
& ( path(head_of(esk7_3(X38,X39,X40)),X39,esk8_3(X38,X39,X40))
| X39 = head_of(esk7_3(X38,X39,X40))
| ~ path(X38,X39,X40) )
& ( X40 = path_cons(esk7_3(X38,X39,X40),esk8_3(X38,X39,X40))
| X39 = head_of(esk7_3(X38,X39,X40))
| ~ path(X38,X39,X40) )
& ( path(head_of(esk7_3(X38,X39,X40)),X39,esk8_3(X38,X39,X40))
| X40 = path_cons(esk7_3(X38,X39,X40),empty)
| ~ path(X38,X39,X40) )
& ( X40 = path_cons(esk7_3(X38,X39,X40),esk8_3(X38,X39,X40))
| X40 = path_cons(esk7_3(X38,X39,X40),empty)
| ~ path(X38,X39,X40) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
cnf(c_0_13,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
shortest_path(esk1_0,esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X44,X45,X46,X47] :
( ( edge(X47)
| ~ path(X44,X45,X46)
| ~ on_path(X47,X46) )
& ( in_path(head_of(X47),X46)
| ~ path(X44,X45,X46)
| ~ on_path(X47,X46) )
& ( in_path(tail_of(X47),X46)
| ~ path(X44,X45,X46)
| ~ on_path(X47,X46) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])]) ).
cnf(c_0_16,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
precedes(esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_properties]) ).
cnf(c_0_19,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
path(esk1_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( vertex(X1)
| ~ path(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( edge(X1)
| ~ path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( on_path(esk4_0,esk5_0)
| ~ path(X1,X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X58,X59,X60,X61,X62,X63] :
( ( tail_of(X63) != tail_of(X60)
| head_of(X63) != head_of(X61)
| ~ shortest_path(X58,X59,X62)
| ~ precedes(X60,X61,X62) )
& ( ~ precedes(X61,X60,X62)
| ~ shortest_path(X58,X59,X62)
| ~ precedes(X60,X61,X62) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_26,negated_conjecture,
( esk1_0 = esk2_0
| esk3_0 = esk4_0
| ~ vertex(esk1_0)
| ~ vertex(esk2_0)
| ~ edge(esk3_0)
| ~ edge(esk4_0)
| ~ path(esk1_0,esk2_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
vertex(esk1_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
vertex(esk2_0),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
on_path(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( on_path(esk3_0,esk5_0)
| ~ path(X1,X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_32,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( esk3_0 = esk4_0
| esk2_0 = esk1_0
| ~ edge(esk3_0)
| ~ edge(esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_20])]),c_0_27]),c_0_28])]) ).
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_20]) ).
cnf(c_0_36,negated_conjecture,
( ~ precedes(X1,X2,esk5_0)
| ~ precedes(X2,X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( esk2_0 = esk1_0
| esk3_0 = esk4_0
| ~ edge(esk3_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,negated_conjecture,
~ precedes(esk4_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_40,negated_conjecture,
( esk3_0 = esk4_0
| esk2_0 = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
( esk2_0 = esk1_0
| ~ precedes(esk4_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( X1 != X2
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_43,negated_conjecture,
esk2_0 = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_40]),c_0_41]) ).
cnf(c_0_44,plain,
~ shortest_path(X1,X1,X2),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRA003+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n029.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 20:14:52 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.MmZXYN4Dno/E---3.1_9721.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # sh5l with pid 9802 completed with status 0
% 0.14/0.41 # Result found by sh5l
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.14/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9810 completed with status 0
% 0.14/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.14/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.14/0.41 # Preprocessing time : 0.002 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 18
% 0.14/0.41 # Removed by relevancy pruning/SinE : 1
% 0.14/0.41 # Initial clauses : 56
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 56
% 0.14/0.41 # Processed clauses : 117
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 117
% 0.14/0.41 # Other redundant clauses eliminated : 7
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 10
% 0.14/0.41 # Generated clauses : 34
% 0.14/0.41 # ...of the previous two non-redundant : 36
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 9
% 0.14/0.41 # Paramodulations : 30
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 7
% 0.14/0.41 # Total rewrite steps : 17
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 47
% 0.14/0.41 # Positive orientable unit clauses : 9
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 3
% 0.14/0.41 # Non-unit-clauses : 35
% 0.14/0.41 # Current number of unprocessed clauses: 30
% 0.14/0.41 # ...number of literals in the above : 100
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 66
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 768
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 407
% 0.14/0.41 # Non-unit clause-clause subsumptions : 9
% 0.14/0.41 # Unit Clause-clause subsumption calls : 41
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 6
% 0.14/0.41 # BW rewrite match successes : 6
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 4419
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.010 s
% 0.14/0.41 # System time : 0.002 s
% 0.14/0.41 # Total time : 0.012 s
% 0.14/0.41 # Maximum resident set size: 1888 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.010 s
% 0.14/0.41 # System time : 0.005 s
% 0.14/0.41 # Total time : 0.015 s
% 0.14/0.41 # Maximum resident set size: 1708 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------