TSTP Solution File: CSR017+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR017+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 19:17:09 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 22 unt; 0 def)
% Number of atoms : 425 ( 209 equ)
% Maximal formula atoms : 149 ( 7 avg)
% Number of connectives : 510 ( 144 ~; 253 |; 100 &)
% ( 11 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(happens_terminates_not_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(less_property,axiom,
! [X9,X10] :
( less(X9,X10)
<=> ( ~ less(X10,X9)
& X10 != X9 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = push
& X5 = n0 )
| ( X4 = pull
& X5 = n1 )
| ( X4 = pull
& X5 = n2 )
| ( X4 = push
& X5 = n2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(less_or_equal,axiom,
! [X9,X10] :
( less_or_equal(X9,X10)
<=> ( less(X9,X10)
| X9 = X10 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(not_spinning_1,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_1) ).
fof(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(less2,axiom,
! [X9] :
( less(X9,n2)
<=> less_or_equal(X9,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(less1,axiom,
! [X9] :
( less(X9,n1)
<=> less_or_equal(X9,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(c_0_11,plain,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[happens_terminates_not_holds]) ).
fof(c_0_12,plain,
! [X22,X23,X24] :
( ~ happens(X22,X23)
| ~ terminates(X22,X24,X23)
| ~ holdsAt(X24,plus(X23,n1)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X39,X40] : plus(X39,X40) = plus(X40,X39),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_14,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_15,plain,
! [X2,X4,X5] :
( epred2_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) ) ) ),
introduced(definition) ).
cnf(c_0_16,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
fof(c_0_19,plain,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[terminates_all_defn]),c_0_14]) ).
fof(c_0_20,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( epred2_3(X5,X4,X2)
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_21,plain,
! [X9,X10] :
( less(X9,X10)
<=> ( ~ less(X10,X9)
& X10 != X9 ) ),
inference(fof_simplification,[status(thm)],[less_property]) ).
cnf(c_0_22,plain,
( ~ holdsAt(X1,plus(n1,X2))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
fof(c_0_24,plain,
! [X30,X31,X32] :
( ( ~ terminates(X30,X31,X32)
| epred3_3(X32,X30,X31) )
& ( ~ epred3_3(X32,X30,X31)
| terminates(X30,X31,X32) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_25,plain,
! [X55,X56,X57] :
( ( X56 = pull
| X56 = push
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X56 = push
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X56 = push
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X55 = spinning
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X55 = spinning
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X55 = spinning
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| ~ happens(pull,X57)
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| ~ happens(pull,X57)
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| ~ happens(pull,X57)
| X56 = pull
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X56 = push
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X56 = push
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X56 = push
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X55 = spinning
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X55 = spinning
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X55 = spinning
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| ~ happens(pull,X57)
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| ~ happens(pull,X57)
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| ~ happens(pull,X57)
| X55 = backwards
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X56 = push
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X56 = push
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X56 = push
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| X55 = spinning
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| X55 = spinning
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| X55 = spinning
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X56 = pull
| ~ happens(pull,X57)
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( X55 = spinning
| ~ happens(pull,X57)
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ happens(push,X57)
| ~ happens(pull,X57)
| happens(push,X57)
| epred2_3(X57,X56,X55)
| ~ epred3_3(X57,X56,X55) )
& ( ~ epred2_3(X57,X56,X55)
| epred3_3(X57,X56,X55) )
& ( X56 != pull
| X55 != backwards
| ~ happens(push,X57)
| epred3_3(X57,X56,X55) )
& ( X56 != push
| X55 != spinning
| happens(pull,X57)
| epred3_3(X57,X56,X55) )
& ( X56 != pull
| X55 != spinning
| happens(push,X57)
| epred3_3(X57,X56,X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
fof(c_0_26,plain,
! [X47,X48] :
( ( X47 = push
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X47 = push
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X47 = pull
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X47 = pull
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 = push
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X48 = n2
| X48 = n2
| X48 = n1
| X48 = n0
| ~ happens(X47,X48) )
& ( X47 != push
| X48 != n0
| happens(X47,X48) )
& ( X47 != pull
| X48 != n1
| happens(X47,X48) )
& ( X47 != pull
| X48 != n2
| happens(X47,X48) )
& ( X47 != push
| X48 != n2
| happens(X47,X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).
fof(c_0_27,plain,
! [X43,X44] :
( ( ~ less(X44,X43)
| ~ less(X43,X44) )
& ( X44 != X43
| ~ less(X43,X44) )
& ( less(X44,X43)
| X44 = X43
| less(X43,X44) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_28,plain,
! [X45,X46] :
( ( ~ less_or_equal(X45,X46)
| less(X45,X46)
| X45 = X46 )
& ( ~ less(X45,X46)
| less_or_equal(X45,X46) )
& ( X45 != X46
| less_or_equal(X45,X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_or_equal])])])]) ).
cnf(c_0_29,plain,
( ~ holdsAt(X1,n1)
| ~ terminates(X2,X1,n0)
| ~ happens(X2,n0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( terminates(X2,X3,X1)
| ~ epred3_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( happens(pull,X3)
| epred3_3(X3,X1,X2)
| X1 != push
| X2 != spinning ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_32,negated_conjecture,
holdsAt(spinning,n1),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_spinning_1])]) ).
cnf(c_0_33,plain,
( happens(X1,X2)
| X1 != push
| X2 != n0 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_34,plain,
push != pull,
inference(fof_simplification,[status(thm)],[push_not_pull]) ).
cnf(c_0_35,plain,
( X1 != X2
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_36,plain,
! [X41] :
( ( ~ less(X41,n2)
| less_or_equal(X41,n1) )
& ( ~ less_or_equal(X41,n1)
| less(X41,n2) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less2])])]) ).
fof(c_0_37,plain,
! [X26] :
( ( ~ less(X26,n1)
| less_or_equal(X26,n0) )
& ( ~ less_or_equal(X26,n0)
| less(X26,n1) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less1])])]) ).
cnf(c_0_38,plain,
( less_or_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( X1 = push
| X2 = n2
| X2 = n1
| X1 = push
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_40,plain,
( ~ epred3_3(n0,X1,X2)
| ~ holdsAt(X2,n1)
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
( epred3_3(X1,push,spinning)
| happens(pull,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
holdsAt(spinning,n1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])]) ).
fof(c_0_44,plain,
push != pull,
inference(fof_nnf,[status(thm)],[c_0_34]) ).
cnf(c_0_45,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_46,plain,
( less(X1,n2)
| ~ less_or_equal(X1,n1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
( less(X1,n1)
| ~ less_or_equal(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,plain,
less_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
( X2 = n1
| X2 = n2
| X1 = push
| ~ happens(X1,X2) ),
inference(cn,[status(thm)],[c_0_39]) ).
cnf(c_0_50,plain,
happens(pull,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_51,plain,
push != pull,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
~ less_or_equal(n2,n1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,plain,
( less_or_equal(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_54,plain,
less(n0,n1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,plain,
( n0 = n2
| n0 = n1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_56,plain,
~ less(n2,n1),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
n0 = n1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_58,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_57]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : CSR017+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n021.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.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 00:43:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_1 with pid 27323 completed with status 0
% 0.20/0.50 # Result found by new_bool_1
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.20/0.50 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 27325 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.003 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 48
% 0.20/0.50 # Removed by relevancy pruning/SinE : 17
% 0.20/0.50 # Initial clauses : 154
% 0.20/0.50 # Removed in clause preprocessing : 9
% 0.20/0.50 # Initial clauses in saturation : 145
% 0.20/0.50 # Processed clauses : 279
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 83
% 0.20/0.50 # ...remaining for further processing : 196
% 0.20/0.50 # Other redundant clauses eliminated : 49
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 25
% 0.20/0.50 # Generated clauses : 157
% 0.20/0.50 # ...of the previous two non-redundant : 119
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 3
% 0.20/0.50 # Paramodulations : 75
% 0.20/0.50 # Factorizations : 46
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 49
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 38
% 0.20/0.50 # ...of those cached : 23
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 74
% 0.20/0.50 # Positive orientable unit clauses : 10
% 0.20/0.50 # Positive unorientable unit clauses: 1
% 0.20/0.50 # Negative unit clauses : 14
% 0.20/0.50 # Non-unit-clauses : 49
% 0.20/0.50 # Current number of unprocessed clauses: 60
% 0.20/0.50 # ...number of literals in the above : 197
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 107
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 860
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 516
% 0.20/0.50 # Non-unit clause-clause subsumptions : 73
% 0.20/0.50 # Unit Clause-clause subsumption calls : 151
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 28
% 0.20/0.50 # BW rewrite match successes : 27
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 7614
% 0.20/0.50 # Search garbage collected termcells : 1356
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.015 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.018 s
% 0.20/0.50 # Maximum resident set size: 2100 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.017 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.022 s
% 0.20/0.50 # Maximum resident set size: 1748 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------