TSTP Solution File: GRA003+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRA003+1 : TPTP v8.2.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 May 20 20:41:21 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 12 unt; 0 def)
% Number of atoms : 217 ( 46 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 264 ( 93 ~; 86 |; 66 &)
% ( 4 <=>; 13 =>; 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 : 123 ( 20 sgn 75 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/Axioms/GRA001+0.ax',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/sandbox2/benchmark/Axioms/GRA001+0.ax',path_properties) ).
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/sandbox2/benchmark/Axioms/GRA001+0.ax',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/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(c_0_6,plain,
! [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)) ) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_defn]) ).
fof(c_0_7,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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[vertices_and_edges])]) ).
fof(c_0_8,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_9,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_10,plain,
! [X53,X54,X55,X56,X57,X58,X59] :
( ( path(X53,X54,X55)
| ~ shortest_path(X53,X54,X55) )
& ( X53 != X54
| ~ shortest_path(X53,X54,X55) )
& ( ~ path(X53,X54,X56)
| less_or_equal(length_of(X55),length_of(X56))
| ~ shortest_path(X53,X54,X55) )
& ( path(X57,X58,esk6_3(X57,X58,X59))
| ~ path(X57,X58,X59)
| X57 = X58
| shortest_path(X57,X58,X59) )
& ( ~ less_or_equal(length_of(X59),length_of(esk6_3(X57,X58,X59)))
| ~ path(X57,X58,X59)
| X57 = X58
| shortest_path(X57,X58,X59) ) ),
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_6])])])])])])]) ).
fof(c_0_11,negated_conjecture,
( shortest_path(esk9_0,esk10_0,esk13_0)
& precedes(esk11_0,esk12_0,esk13_0)
& ( ~ vertex(esk9_0)
| ~ vertex(esk10_0)
| esk9_0 = esk10_0
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| esk11_0 = esk12_0
| ~ path(esk9_0,esk10_0,esk13_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_12,plain,
! [X46,X47,X48,X49,X50,X51] :
( ( on_path(X49,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( on_path(X50,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( ~ sequential(X49,X50)
| ~ sequential(X49,X51)
| ~ precedes(X51,X50,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( sequential(X49,esk5_3(X46,X49,X50))
| sequential(X49,X50)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( precedes(esk5_3(X46,X49,X50),X50,X46)
| sequential(X49,X50)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) ) ),
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_8])])])])])])]) ).
fof(c_0_13,plain,
! [X23,X24,X25,X27] :
( ( vertex(X23)
| ~ path(X23,X24,X25) )
& ( vertex(X24)
| ~ path(X23,X24,X25) )
& ( edge(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( X23 = tail_of(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( X24 != head_of(esk2_3(X23,X24,X25))
| X25 != path_cons(esk2_3(X23,X24,X25),empty)
| ~ path(head_of(esk2_3(X23,X24,X25)),X24,X27)
| X25 != path_cons(esk2_3(X23,X24,X25),X27)
| ~ path(X23,X24,X25) )
& ( path(head_of(esk2_3(X23,X24,X25)),X24,esk3_3(X23,X24,X25))
| X24 = head_of(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( X25 = path_cons(esk2_3(X23,X24,X25),esk3_3(X23,X24,X25))
| X24 = head_of(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( path(head_of(esk2_3(X23,X24,X25)),X24,esk3_3(X23,X24,X25))
| X25 = path_cons(esk2_3(X23,X24,X25),empty)
| ~ path(X23,X24,X25) )
& ( X25 = path_cons(esk2_3(X23,X24,X25),esk3_3(X23,X24,X25))
| X25 = path_cons(esk2_3(X23,X24,X25),empty)
| ~ path(X23,X24,X25) ) ),
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_9])])])])])]) ).
cnf(c_0_14,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X29,X30,X31,X32] :
( ( edge(X32)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) )
& ( in_path(head_of(X32),X31)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) )
& ( in_path(tail_of(X32),X31)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) ) ),
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_17,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( vertex(X1)
| ~ path(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( edge(X1)
| ~ path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( esk9_0 = esk10_0
| esk11_0 = esk12_0
| ~ vertex(esk9_0)
| ~ vertex(esk10_0)
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| ~ path(esk9_0,esk10_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,negated_conjecture,
vertex(esk9_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
vertex(esk10_0),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
fof(c_0_31,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_32,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0
| ~ edge(esk11_0)
| ~ edge(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_20])]),c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
fof(c_0_35,plain,
! [X61,X62,X63,X64,X65,X66] :
( ( tail_of(X66) != tail_of(X63)
| head_of(X66) != head_of(X64)
| ~ shortest_path(X61,X62,X65)
| ~ precedes(X63,X64,X65) )
& ( ~ precedes(X64,X63,X65)
| ~ shortest_path(X61,X62,X65)
| ~ precedes(X63,X64,X65) ) ),
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_31])])])])]) ).
cnf(c_0_36,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0
| ~ edge(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_38,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
( ~ precedes(X1,X2,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_15]) ).
cnf(c_0_41,negated_conjecture,
( esk10_0 = esk9_0
| precedes(esk12_0,esk12_0,esk13_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_42,plain,
( X1 != X2
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,negated_conjecture,
esk10_0 = esk9_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),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_15,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRA003+1 : TPTP v8.2.0. Bugfixed v3.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 12:49:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0
% 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20223 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.21/0.50 # Starting G-E--_107_C36_F1_PI_AE_Q4_CS_SP_PS_S0Y with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 151s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 151s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 146s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20229 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.21/0.50 # Preprocessing time : 0.002 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 18
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 62
% 0.21/0.51 # Removed in clause preprocessing : 1
% 0.21/0.51 # Initial clauses in saturation : 61
% 0.21/0.51 # Processed clauses : 125
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 125
% 0.21/0.51 # Other redundant clauses eliminated : 7
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 10
% 0.21/0.51 # Generated clauses : 40
% 0.21/0.51 # ...of the previous two non-redundant : 40
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 9
% 0.21/0.51 # Paramodulations : 36
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 7
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 19
% 0.21/0.51 # ...of those cached : 10
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 50
% 0.21/0.51 # Positive orientable unit clauses : 9
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 3
% 0.21/0.51 # Non-unit-clauses : 38
% 0.21/0.51 # Current number of unprocessed clauses: 36
% 0.21/0.51 # ...number of literals in the above : 130
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 71
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 855
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 445
% 0.21/0.51 # Non-unit clause-clause subsumptions : 9
% 0.21/0.51 # Unit Clause-clause subsumption calls : 87
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 6
% 0.21/0.51 # BW rewrite match successes : 6
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 5523
% 0.21/0.51 # Search garbage collected termcells : 1259
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.013 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 1896 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.050 s
% 0.21/0.51 # System time : 0.009 s
% 0.21/0.51 # Total time : 0.059 s
% 0.21/0.51 # Maximum resident set size: 1760 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------