%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRA004+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 : n026.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:51 PM UTC 2026
% Result : Theorem 0.21s 0.46s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 62 ( 14 unt; 0 def)
% Number of atoms : 252 ( 68 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 310 ( 120 ~; 104 |; 62 &)
% ( 5 <=>; 17 =>; 1 <=; 1 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 155 ( 18 sgn 95 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(shortest_path_properties_lemma,conjecture,
! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( head_of(X8) != head_of(X7)
& head_of(X8) != tail_of(X7)
& ~ ? [X9] :
( head_of(X9) = head_of(X8)
& tail_of(X9) = tail_of(X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma) ).
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(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(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(sequential_defn,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( head_of(X7) = tail_of(X8)
& X7 != X8
& edge(X8)
& edge(X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(precedes_defn,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
<= ( ( ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) )
| sequential(X7,X8) )
& on_path(X8,X4)
& on_path(X7,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
fof(no_loops,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',no_loops) ).
fof(c_0_8,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( head_of(X8) != head_of(X7)
& head_of(X8) != tail_of(X7)
& ~ ? [X9] :
( head_of(X9) = head_of(X8)
& tail_of(X9) = tail_of(X7) ) ) ),
inference(assume_negation,[status(cth)],[shortest_path_properties_lemma]) ).
fof(c_0_9,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_10,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( precedes(X7,X8,X4)
& shortest_path(X2,X3,X4) )
=> ( head_of(X8) != head_of(X7)
& head_of(X8) != tail_of(X7)
& ~ ? [X9] :
( head_of(X9) = head_of(X8)
& tail_of(X9) = tail_of(X7) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_11,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_12,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]) ).
fof(c_0_13,plain,
! [X62,X63,X64,X65,X66,X67,X68] :
( ( shortest_path(X66,X67,X68)
| X66 = X67
| ~ path(X66,X67,X68)
| ~ less_or_equal(length_of(X68),length_of(esk11_3(X66,X67,X68))) )
& ( shortest_path(X66,X67,X68)
| X66 = X67
| ~ path(X66,X67,X68)
| path(X66,X67,esk11_3(X66,X67,X68)) )
& ( ~ shortest_path(X62,X63,X64)
| less_or_equal(length_of(X64),length_of(X65))
| ~ path(X62,X63,X65) )
& ( ~ shortest_path(X62,X63,X64)
| X62 != X63 )
& ( ~ shortest_path(X62,X63,X64)
| path(X62,X63,X64) ) ),
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,negated_conjecture,
( ( head_of(esk4_0) = head_of(esk3_0)
| head_of(esk4_0) = tail_of(esk3_0)
| head_of(esk6_0) = head_of(esk4_0) )
& ( head_of(esk4_0) = head_of(esk3_0)
| head_of(esk4_0) = tail_of(esk3_0)
| tail_of(esk6_0) = tail_of(esk3_0) )
& precedes(esk3_0,esk4_0,esk5_0)
& shortest_path(esk1_0,esk2_0,esk5_0) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_15,plain,
! [X55,X56,X57,X58,X59,X60] :
( ( ~ path(X56,X57,X55)
| ~ precedes(X58,X59,X55)
| sequential(X58,X59)
| precedes(esk10_3(X55,X58,X59),X59,X55) )
& ( ~ path(X56,X57,X55)
| ~ precedes(X58,X59,X55)
| sequential(X58,X59)
| sequential(X58,esk10_3(X55,X58,X59)) )
& ( ~ path(X56,X57,X55)
| ~ precedes(X58,X59,X55)
| ~ precedes(X60,X59,X55)
| ~ sequential(X58,X60)
| ~ sequential(X58,X59) )
& ( ~ path(X56,X57,X55)
| ~ precedes(X58,X59,X55)
| on_path(X59,X55) )
& ( ~ path(X56,X57,X55)
| ~ precedes(X58,X59,X55)
| on_path(X58,X55) ) ),
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_11])])])])])])]) ).
fof(c_0_16,plain,
! [X43,X44,X45,X46,X47,X48] :
( ( ~ precedes(X45,X46,X47)
| ~ shortest_path(X43,X44,X47)
| ~ precedes(X46,X45,X47) )
& ( ~ precedes(X45,X46,X47)
| ~ shortest_path(X43,X44,X47)
| head_of(X48) != head_of(X46)
| tail_of(X48) != tail_of(X45) ) ),
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_12])])])])]) ).
fof(c_0_17,plain,
! [X32,X33,X34,X35] :
( ( ~ on_path(X35,X34)
| ~ path(X32,X33,X34)
| in_path(tail_of(X35),X34) )
& ( ~ on_path(X35,X34)
| ~ path(X32,X33,X34)
| in_path(head_of(X35),X34) )
& ( ~ on_path(X35,X34)
| ~ path(X32,X33,X34)
| edge(X35) ) ),
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,
( ~ shortest_path(X1,X2,X3)
| path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
shortest_path(esk1_0,esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ path(X4,X5,X2)
| ~ precedes(X1,X3,X2)
| on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
precedes(esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ precedes(X2,X3,X6)
| ~ shortest_path(X4,X5,X6)
| head_of(X1) != head_of(X3)
| tail_of(X1) != tail_of(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_23,plain,
! [X7,X8] :
( sequential(X7,X8)
<=> ( head_of(X7) = tail_of(X8)
& X7 != X8
& edge(X8)
& edge(X7) ) ),
inference(fof_simplification,[status(thm)],[sequential_defn]) ).
cnf(c_0_24,plain,
( ~ on_path(X1,X4)
| ~ path(X2,X3,X4)
| edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
path(esk1_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( ~ path(X1,X2,esk5_0)
| on_path(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ path(X4,X5,X2)
| ~ precedes(X3,X1,X2)
| on_path(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( ~ precedes(X3,X2,esk5_0)
| tail_of(X1) != tail_of(X3)
| head_of(X1) != head_of(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
fof(c_0_29,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( ( ( ? [X9] :
( precedes(X9,X8,X4)
& sequential(X7,X9) )
| sequential(X7,X8) )
& on_path(X8,X4)
& on_path(X7,X4) )
=> precedes(X7,X8,X4) ) ),
inference(fof_simplification,[status(thm)],[precedes_defn]) ).
fof(c_0_30,plain,
! [X41,X42] :
( ( sequential(X41,X42)
| head_of(X41) != tail_of(X42)
| X41 = X42
| ~ edge(X42)
| ~ edge(X41) )
& ( ~ sequential(X41,X42)
| head_of(X41) = tail_of(X42) )
& ( ~ sequential(X41,X42)
| X41 != X42 )
& ( ~ sequential(X41,X42)
| edge(X42) )
& ( ~ sequential(X41,X42)
| edge(X41) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ on_path(X1,esk5_0)
| edge(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
on_path(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( ~ path(X1,X2,esk5_0)
| on_path(esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
( tail_of(X1) != tail_of(esk3_0)
| head_of(X1) != head_of(esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
fof(c_0_35,plain,
! [X49,X50,X51,X52,X53,X54] :
( ( ~ path(X50,X51,X49)
| precedes(X52,X53,X49)
| ~ on_path(X53,X49)
| ~ on_path(X52,X49)
| ~ precedes(X54,X53,X49)
| ~ sequential(X52,X54) )
& ( ~ path(X50,X51,X49)
| precedes(X52,X53,X49)
| ~ on_path(X53,X49)
| ~ on_path(X52,X49)
| ~ sequential(X52,X53) ) ),
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_29])])])])]) ).
cnf(c_0_36,plain,
( head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1)
| sequential(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
edge(esk3_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
on_path(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_39,negated_conjecture,
( head_of(esk4_0) = head_of(esk3_0)
| head_of(esk4_0) = tail_of(esk3_0)
| tail_of(esk6_0) = tail_of(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,negated_conjecture,
head_of(esk3_0) != head_of(esk4_0),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( head_of(esk4_0) = head_of(esk3_0)
| head_of(esk4_0) = tail_of(esk3_0)
| head_of(esk6_0) = head_of(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,plain,
( ~ path(X4,X5,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
( ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_44,negated_conjecture,
( ~ edge(X1)
| tail_of(esk3_0) != head_of(X1)
| sequential(X1,esk3_0)
| X1 = esk3_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
edge(esk4_0),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( tail_of(esk6_0) = tail_of(esk3_0)
| tail_of(esk3_0) = head_of(esk4_0) ),
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( tail_of(esk3_0) = head_of(esk4_0)
| head_of(esk6_0) = head_of(esk4_0) ),
inference(sr,[status(thm)],[c_0_41,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( ~ on_path(X1,esk5_0)
| ~ on_path(X2,esk5_0)
| ~ sequential(X1,X2)
| precedes(X1,X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_49,negated_conjecture,
( ~ precedes(X2,X1,esk5_0)
| ~ precedes(X1,X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_19]) ).
fof(c_0_50,plain,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
inference(fof_simplification,[status(thm)],[no_loops]) ).
cnf(c_0_51,negated_conjecture,
( tail_of(esk3_0) != head_of(esk4_0)
| sequential(esk4_0,esk3_0)
| esk3_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
tail_of(esk3_0) = head_of(esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_46]),c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( ~ on_path(X1,esk5_0)
| ~ sequential(X1,esk3_0)
| precedes(X1,esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_32]) ).
cnf(c_0_54,negated_conjecture,
~ precedes(esk4_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_49,c_0_21]) ).
fof(c_0_55,plain,
! [X19] :
( head_of(X19) != tail_of(X19)
| ~ edge(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])]) ).
cnf(c_0_56,negated_conjecture,
( sequential(esk4_0,esk3_0)
| esk3_0 = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_57,negated_conjecture,
~ sequential(esk4_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_54]) ).
cnf(c_0_58,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,negated_conjecture,
esk3_0 = esk4_0,
inference(sr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
tail_of(esk4_0) != head_of(esk4_0),
inference(spm,[status(thm)],[c_0_58,c_0_45]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_59]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA004+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 18:20:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.21/0.46 % Version: 3.5.1
% 0.21/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.46 % Starting sh5l with 300s (1) cores
% 0.21/0.46 % sh5l with pid 325044 completed with status 0
% 0.21/0.46 % Result found by sh5l
% 0.21/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.46 % Starting sh5l with 300s (1) cores
% 0.21/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.46 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.21/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.46 % SubtermCWHack with pid 325051 completed with status 0
% 0.21/0.46 % Result found by SubtermCWHack
% 0.21/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.46 % Starting sh5l with 300s (1) cores
% 0.21/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.46 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.21/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.46 % Preprocessing time : 0.002 s
% 0.21/0.46
% 0.21/0.46 % Proof found!
% 0.21/0.46 % SZS status Theorem
% 0.21/0.46 % SZS output start CNFRefutation
% See solution above
% 0.21/0.46 % Parsed axioms : 18
% 0.21/0.46 % Removed by relevancy pruning/SinE : 0
% 0.21/0.46 % Initial clauses : 63
% 0.21/0.46 % Removed in clause preprocessing : 1
% 0.21/0.46 % Initial clauses in saturation : 62
% 0.21/0.46 % Processed clauses : 161
% 0.21/0.46 % ...of these trivial : 3
% 0.21/0.46 % ...subsumed : 19
% 0.21/0.46 % ...remaining for further processing : 139
% 0.21/0.46 % Other redundant clauses eliminated : 13
% 0.21/0.46 % Clauses deleted for lack of memory : 0
% 0.21/0.46 % Backward-subsumed : 2
% 0.21/0.46 % Backward-rewritten : 20
% 0.21/0.46 % Generated clauses : 242
% 0.21/0.46 % ...of the previous two non-redundant : 203
% 0.21/0.46 % ...aggressively subsumed : 0
% 0.21/0.46 % Contextual simplify-reflections : 7
% 0.21/0.46 % Paramodulations : 228
% 0.21/0.46 % Factorizations : 0
% 0.21/0.46 % NegExts : 0
% 0.21/0.46 % Equation resolutions : 14
% 0.21/0.46 % Disequality decompositions : 0
% 0.21/0.46 % Total rewrite steps : 67
% 0.21/0.46 % ...of those cached : 52
% 0.21/0.46 % Propositional unsat checks : 0
% 0.21/0.46 % Propositional check models : 0
% 0.21/0.46 % Propositional check unsatisfiable : 0
% 0.21/0.46 % Propositional clauses : 0
% 0.21/0.46 % Propositional clauses after purity: 0
% 0.21/0.46 % Propositional unsat core size : 0
% 0.21/0.46 % Propositional preprocessing time : 0.000
% 0.21/0.46 % Propositional encoding time : 0.000
% 0.21/0.46 % Propositional solver time : 0.000
% 0.21/0.46 % Success case prop preproc time : 0.000
% 0.21/0.46 % Success case prop encoding time : 0.000
% 0.21/0.46 % Success case prop solver time : 0.000
% 0.21/0.46 % Current number of processed clauses : 110
% 0.21/0.46 % Positive orientable unit clauses : 18
% 0.21/0.46 % Positive unorientable unit clauses: 0
% 0.21/0.46 % Negative unit clauses : 3
% 0.21/0.46 % Non-unit-clauses : 89
% 0.21/0.46 % Current number of unprocessed clauses: 97
% 0.21/0.46 % ...number of literals in the above : 407
% 0.21/0.46 % Current number of archived formulas : 0
% 0.21/0.46 % Current number of archived clauses : 25
% 0.21/0.46 % Clause-clause subsumption calls (NU) : 922
% 0.21/0.46 % Rec. Clause-clause subsumption calls : 570
% 0.21/0.46 % Non-unit clause-clause subsumptions : 22
% 0.21/0.46 % Unit Clause-clause subsumption calls : 72
% 0.21/0.46 % Rewrite failures with RHS unbound : 0
% 0.21/0.46 % BW rewrite match attempts : 6
% 0.21/0.46 % BW rewrite match successes : 5
% 0.21/0.46 % Condensation attempts : 0
% 0.21/0.46 % Condensation successes : 0
% 0.21/0.46 % Termbank termtop insertions : 7906
% 0.21/0.46 % Search garbage collected termcells : 1249
% 0.21/0.46
% 0.21/0.46 % -------------------------------------------------
% 0.21/0.46 % User time : 0.020 s
% 0.21/0.46 % System time : 0.002 s
% 0.21/0.46 % Total time : 0.022 s
% 0.21/0.46 % Maximum resident set size: 3924 pages
% 0.21/0.46
% 0.21/0.46 % -------------------------------------------------
% 0.21/0.46 % User time : 0.022 s
% 0.21/0.46 % System time : 0.006 s
% 0.21/0.46 % Total time : 0.029 s
% 0.21/0.46 % Maximum resident set size: 4608 pages
% 0.21/0.46 % E exiting
%------------------------------------------------------------------------------