TSTP Solution File: CSR015+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR015+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Sat May 4 07:35:03 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 490 ( 248 equ)
% Maximal formula atoms : 149 ( 13 avg)
% Number of connectives : 628 ( 175 ~; 324 |; 121 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 41 !; 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/tmp/tmp.tUBMhr3gKZ/E---3.1_17063.p',happens_terminates_not_holds) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox2/tmp/tmp.tUBMhr3gKZ/E---3.1_17063.p',symmetry_of_plus) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/tmp/tmp.tUBMhr3gKZ/E---3.1_17063.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/tmp/tmp.tUBMhr3gKZ/E---3.1_17063.p',terminates_all_defn) ).
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/tmp/tmp.tUBMhr3gKZ/E---3.1_17063.p',happens_all_defn) ).
fof(not_backwards_1,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox2/tmp/tmp.tUBMhr3gKZ/E---3.1_17063.p',not_backwards_1) ).
fof(c_0_6,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_7,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_6])])]) ).
fof(c_0_8,plain,
! [X39,X40] : plus(X39,X40) = plus(X40,X39),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_9,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_10,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_11,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
fof(c_0_14,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_9]) ).
fof(c_0_15,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_9,c_0_10]) ).
cnf(c_0_16,plain,
( ~ holdsAt(X1,plus(n1,X2))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
fof(c_0_18,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_14])])]) ).
fof(c_0_19,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_15])])])]) ).
fof(c_0_20,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])])])]) ).
cnf(c_0_21,plain,
( ~ holdsAt(X1,n1)
| ~ terminates(X2,X1,n0)
| ~ happens(X2,n0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( terminates(X2,X3,X1)
| ~ epred3_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X52,X53,X54] :
( ( X53 = pull
| X53 = pull
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| X53 = pull
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| X53 = pull
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| X52 = forwards
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| X52 = forwards
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| X52 = forwards
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| ~ happens(push,X54)
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| ~ happens(push,X54)
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| ~ happens(push,X54)
| X53 = push
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| X53 = pull
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| X53 = pull
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| X53 = pull
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| X52 = forwards
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| X52 = forwards
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| X52 = forwards
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| ~ happens(push,X54)
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| ~ happens(push,X54)
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| ~ happens(push,X54)
| X52 = backwards
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| X53 = pull
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| X53 = pull
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| X53 = pull
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| X52 = forwards
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| X52 = forwards
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| X52 = forwards
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( X53 = pull
| ~ happens(push,X54)
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( X52 = forwards
| ~ happens(push,X54)
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( happens(push,X54)
| ~ happens(push,X54)
| ~ happens(pull,X54)
| ~ epred2_3(X54,X53,X52) )
& ( X53 != push
| X52 != backwards
| happens(pull,X54)
| epred2_3(X54,X53,X52) )
& ( X53 != pull
| X52 != forwards
| happens(push,X54)
| epred2_3(X54,X53,X52) )
& ( X53 != pull
| X52 != forwards
| ~ happens(push,X54)
| epred2_3(X54,X53,X52) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_24,plain,
( epred3_3(X3,X1,X2)
| X1 != pull
| X2 != backwards
| ~ happens(push,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,negated_conjecture,
holdsAt(backwards,n1),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_backwards_1])]) ).
cnf(c_0_26,plain,
( happens(X1,X2)
| X1 != push
| X2 != n0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ epred3_3(n0,X1,X2)
| ~ holdsAt(X2,n1)
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( epred3_3(X1,X2,X3)
| ~ epred2_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( happens(pull,X3)
| epred2_3(X3,X1,X2)
| X1 != push
| X2 != backwards ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( epred3_3(X1,pull,backwards)
| ~ happens(push,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
holdsAt(backwards,n1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
cnf(c_0_33,plain,
( ~ epred2_3(n0,X1,X2)
| ~ holdsAt(X2,n1)
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( epred2_3(X1,push,backwards)
| happens(pull,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])]) ).
cnf(c_0_35,plain,
~ happens(pull,n0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31]),c_0_32])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR015+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n012.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 : Fri May 3 14:21:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/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/tmp/tmp.tUBMhr3gKZ/E---3.1_17063.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_1 with pid 17143 completed with status 0
% 0.20/0.51 # Result found by new_bool_1
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.20/0.51 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 17146 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FSLM22-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.003 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 48
% 0.20/0.51 # Removed by relevancy pruning/SinE : 17
% 0.20/0.51 # Initial clauses : 154
% 0.20/0.51 # Removed in clause preprocessing : 9
% 0.20/0.51 # Initial clauses in saturation : 145
% 0.20/0.51 # Processed clauses : 275
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 82
% 0.20/0.51 # ...remaining for further processing : 193
% 0.20/0.51 # Other redundant clauses eliminated : 45
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 1
% 0.20/0.51 # Backward-rewritten : 2
% 0.20/0.51 # Generated clauses : 127
% 0.20/0.51 # ...of the previous two non-redundant : 87
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 3
% 0.20/0.51 # Paramodulations : 57
% 0.20/0.51 # Factorizations : 38
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 45
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 19
% 0.20/0.51 # ...of those cached : 7
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 94
% 0.20/0.51 # Positive orientable unit clauses : 15
% 0.20/0.51 # Positive unorientable unit clauses: 1
% 0.20/0.51 # Negative unit clauses : 18
% 0.20/0.51 # Non-unit-clauses : 60
% 0.20/0.51 # Current number of unprocessed clauses: 37
% 0.20/0.51 # ...number of literals in the above : 128
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 84
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 896
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 532
% 0.20/0.51 # Non-unit clause-clause subsumptions : 71
% 0.20/0.51 # Unit Clause-clause subsumption calls : 117
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 26
% 0.20/0.51 # BW rewrite match successes : 25
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 7489
% 0.20/0.51 # Search garbage collected termcells : 1356
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.018 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.021 s
% 0.20/0.51 # Maximum resident set size: 2104 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.022 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.025 s
% 0.20/0.51 # Maximum resident set size: 1744 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------