TSTP Solution File: SWV450+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV450+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Tue May 21 05:24:53 EDT 2024
% Result : Theorem 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 27 unt; 0 def)
% Number of atoms : 256 ( 107 equ)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 326 ( 119 ~; 68 |; 91 &)
% ( 3 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 28 ( 28 usr; 17 con; 0-2 aty)
% Number of variables : 184 ( 26 sgn 136 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj,conjecture,
! [X12,X13,X5,X6] :
( ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) )
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( setIn(host(X7),index(acks,host(X5)))
| host(X7) = host(X6) )
=> ! [X17] :
( host(X7) != host(X17)
=> ( host(X5) = host(X17)
=> ! [X18,X19] :
( host(X7) = host(X19)
=> ( host(X5) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X20),X12)
& elem(m_Down(X18),snoc(queue(host(X19)),m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
fof(axiom_18,axiom,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
fof(axiom_41,axiom,
! [X5,X4] : q_nil != cons(X5,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_41) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(axiom_39,axiom,
! [X4] :
( X4 = q_nil
| X4 = cons(head(X4),tail(X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_39) ).
fof(axiom_36,axiom,
! [X5,X4] : tail(cons(X5,X4)) = X4,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_36) ).
fof(c_0_7,plain,
! [X13,X5,X6,X12] :
( epred1_4(X12,X6,X5,X13)
<=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
introduced(definition) ).
fof(c_0_8,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_4(X12,X6,X5,X13)
=> ( setIn(X5,alive)
=> ( ( index(elid,host(X5)) = X13
& index(status,host(X5)) = elec_2
& host(X6) = index(pendack,host(X5)) )
=> ( leq(nbr_proc,index(pendack,host(X5)))
=> ! [X7] :
( ( setIn(host(X7),index(acks,host(X5)))
| host(X7) = host(X6) )
=> ! [X17] :
( host(X7) != host(X17)
=> ( host(X5) = host(X17)
=> ! [X18,X19] :
( host(X7) = host(X19)
=> ( host(X5) != host(X19)
=> ! [X20] :
( ( host(X19) != host(X17)
& setIn(X17,alive)
& setIn(X19,alive)
& host(X18) = host(X17)
& host(X20) = host(X19) )
=> ~ ( elem(m_Down(X20),X12)
& elem(m_Down(X18),snoc(queue(host(X19)),m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_7]) ).
fof(c_0_9,plain,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
inference(fof_simplification,[status(thm)],[axiom_18]) ).
fof(c_0_10,plain,
! [X13,X5,X6,X12] :
( epred1_4(X12,X6,X5,X13)
=> ( ! [X7,X14] :
( setIn(X14,alive)
=> ~ elem(m_Down(X14),queue(host(X7))) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( elem(m_Down(X14),queue(host(X7)))
=> host(X14) != host(X7) )
& ! [X7,X14] :
( elem(m_Halt(X14),queue(host(X7)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X15,X14] :
( elem(m_Ack(X14,X7),queue(host(X15)))
=> ~ leq(host(X7),host(X14)) )
& ! [X7,X14] :
( ( ~ setIn(X7,alive)
& leq(X14,X7)
& host(X14) = host(X7) )
=> ~ setIn(X14,alive) )
& ! [X7,X14] :
( ( X14 != X7
& host(X14) = host(X7) )
=> ( ~ setIn(X7,alive)
| ~ setIn(X14,alive) ) )
& ! [X7,X16,X15,X14] :
( ( host(X15) != host(X7)
& setIn(X7,alive)
& setIn(X15,alive)
& host(X16) = host(X7)
& host(X14) = host(X15) )
=> ~ ( elem(m_Down(X14),queue(host(X7)))
& elem(m_Down(X16),queue(host(X15))) ) )
& queue(host(X5)) = cons(m_Ack(X13,X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X104,X105,X106] :
( ( ~ elem(X104,snoc(X106,X105))
| X104 = X105
| elem(X104,X106) )
& ( X104 != X105
| elem(X104,snoc(X106,X105)) )
& ( ~ elem(X104,X106)
| elem(X104,snoc(X106,X105)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_12,negated_conjecture,
( epred1_4(esk5_0,esk8_0,esk7_0,esk6_0)
& setIn(esk7_0,alive)
& index(elid,host(esk7_0)) = esk6_0
& index(status,host(esk7_0)) = elec_2
& host(esk8_0) = index(pendack,host(esk7_0))
& leq(nbr_proc,index(pendack,host(esk7_0)))
& ( setIn(host(esk9_0),index(acks,host(esk7_0)))
| host(esk9_0) = host(esk8_0) )
& host(esk9_0) != host(esk10_0)
& host(esk7_0) = host(esk10_0)
& host(esk9_0) = host(esk12_0)
& host(esk7_0) != host(esk12_0)
& host(esk12_0) != host(esk10_0)
& setIn(esk10_0,alive)
& setIn(esk12_0,alive)
& host(esk11_0) = host(esk10_0)
& host(esk13_0) = host(esk12_0)
& elem(m_Down(esk13_0),esk5_0)
& elem(m_Down(esk11_0),snoc(queue(host(esk12_0)),m_Ldr(esk7_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_13,plain,
! [X46,X47] : m_Down(X46) != m_Ldr(X47),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_14,plain,
! [X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179,X180,X181] :
( ( ~ setIn(X164,alive)
| ~ elem(m_Down(X164),queue(host(X163)))
| ~ epred1_4(X162,X161,X160,X159) )
& ( ~ elem(m_Down(X166),queue(host(X165)))
| ~ setIn(X166,alive)
| ~ epred1_4(X162,X161,X160,X159) )
& ( ~ elem(m_Down(X168),queue(host(X167)))
| host(X168) != host(X167)
| ~ epred1_4(X162,X161,X160,X159) )
& ( ~ elem(m_Halt(X170),queue(host(X169)))
| ~ leq(host(X169),host(X170))
| ~ epred1_4(X162,X161,X160,X159) )
& ( ~ elem(m_Ack(X173,X171),queue(host(X172)))
| ~ leq(host(X171),host(X173))
| ~ epred1_4(X162,X161,X160,X159) )
& ( setIn(X174,alive)
| ~ leq(X175,X174)
| host(X175) != host(X174)
| ~ setIn(X175,alive)
| ~ epred1_4(X162,X161,X160,X159) )
& ( X177 = X176
| host(X177) != host(X176)
| ~ setIn(X176,alive)
| ~ setIn(X177,alive)
| ~ epred1_4(X162,X161,X160,X159) )
& ( host(X180) = host(X178)
| ~ setIn(X178,alive)
| ~ setIn(X180,alive)
| host(X179) != host(X178)
| host(X181) != host(X180)
| ~ elem(m_Down(X181),queue(host(X178)))
| ~ elem(m_Down(X179),queue(host(X180)))
| ~ epred1_4(X162,X161,X160,X159) )
& ( queue(host(X160)) = cons(m_Ack(X159,X161),X162)
| ~ epred1_4(X162,X161,X160,X159) ) ),
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_10])])])])]) ).
fof(c_0_15,plain,
! [X5,X4] : q_nil != cons(X5,X4),
inference(fof_simplification,[status(thm)],[axiom_41]) ).
cnf(c_0_16,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
elem(m_Down(esk11_0),snoc(queue(host(esk12_0)),m_Ldr(esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
host(esk11_0) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
host(esk7_0) = host(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X101,X102,X103] :
( ( ~ elem(X101,cons(X102,X103))
| X101 = X102
| elem(X101,X103) )
& ( X101 != X102
| elem(X101,cons(X102,X103)) )
& ( ~ elem(X101,X103)
| elem(X101,cons(X102,X103)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
fof(c_0_22,plain,
! [X90] :
( X90 = q_nil
| X90 = cons(head(X90),tail(X90)) ),
inference(variable_rename,[status(thm)],[axiom_39]) ).
fof(c_0_23,plain,
! [X84,X85] : tail(cons(X84,X85)) = X85,
inference(variable_rename,[status(thm)],[axiom_36]) ).
cnf(c_0_24,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
epred1_4(esk5_0,esk8_0,esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X92,X93] : q_nil != cons(X92,X93),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_27,plain,
( host(X1) = host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| host(X3) != host(X2)
| host(X4) != host(X1)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ epred1_4(X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,negated_conjecture,
elem(m_Down(esk11_0),queue(host(esk12_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_29,negated_conjecture,
host(esk11_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
setIn(esk12_0,alive),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_31,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( X1 = q_nil
| X1 = cons(head(X1),tail(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
tail(cons(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
cons(m_Ack(esk6_0,esk8_0),esk5_0) = queue(host(esk7_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,plain,
q_nil != cons(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( host(X1) = host(esk12_0)
| host(esk12_0) != host(X2)
| host(X1) != host(esk7_0)
| ~ epred1_4(X3,X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
setIn(esk10_0,alive),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,negated_conjecture,
host(esk7_0) != host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,plain,
( X1 = q_nil
| elem(X2,X1)
| ~ elem(X2,tail(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
tail(queue(host(esk7_0))) = esk5_0,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
queue(host(esk7_0)) != q_nil,
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( host(esk12_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),queue(host(esk7_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_37])]),c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( elem(X1,queue(host(esk7_0)))
| ~ elem(X1,esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( host(esk12_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
elem(m_Down(esk13_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,negated_conjecture,
host(esk13_0) = host(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_47,negated_conjecture,
~ epred1_4(X1,X2,X3,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_25,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV450+1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 08:27:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.20/0.57 # Version: 3.1.0
% 0.20/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.57 # Starting sh5l with 300s (1) cores
% 0.20/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7217 completed with status 0
% 0.20/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.57 # No SInE strategy applied
% 0.20/0.57 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.20/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.57 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.57 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 7226 completed with status 0
% 0.20/0.57 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.57 # No SInE strategy applied
% 0.20/0.57 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.20/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.57 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.57 # Preprocessing time : 0.006 s
% 0.20/0.57
% 0.20/0.57 # Proof found!
% 0.20/0.57 # SZS status Theorem
% 0.20/0.57 # SZS output start CNFRefutation
% See solution above
% 0.20/0.57 # Parsed axioms : 67
% 0.20/0.57 # Removed by relevancy pruning/SinE : 0
% 0.20/0.57 # Initial clauses : 123
% 0.20/0.57 # Removed in clause preprocessing : 6
% 0.20/0.57 # Initial clauses in saturation : 117
% 0.20/0.57 # Processed clauses : 490
% 0.20/0.57 # ...of these trivial : 9
% 0.20/0.57 # ...subsumed : 176
% 0.20/0.57 # ...remaining for further processing : 305
% 0.20/0.57 # Other redundant clauses eliminated : 10
% 0.20/0.57 # Clauses deleted for lack of memory : 0
% 0.20/0.57 # Backward-subsumed : 30
% 0.20/0.57 # Backward-rewritten : 11
% 0.20/0.57 # Generated clauses : 1306
% 0.20/0.57 # ...of the previous two non-redundant : 1050
% 0.20/0.57 # ...aggressively subsumed : 0
% 0.20/0.57 # Contextual simplify-reflections : 4
% 0.20/0.57 # Paramodulations : 1271
% 0.20/0.57 # Factorizations : 2
% 0.20/0.57 # NegExts : 0
% 0.20/0.57 # Equation resolutions : 32
% 0.20/0.57 # Disequality decompositions : 0
% 0.20/0.57 # Total rewrite steps : 371
% 0.20/0.57 # ...of those cached : 294
% 0.20/0.57 # Propositional unsat checks : 0
% 0.20/0.57 # Propositional check models : 0
% 0.20/0.57 # Propositional check unsatisfiable : 0
% 0.20/0.57 # Propositional clauses : 0
% 0.20/0.57 # Propositional clauses after purity: 0
% 0.20/0.57 # Propositional unsat core size : 0
% 0.20/0.57 # Propositional preprocessing time : 0.000
% 0.20/0.57 # Propositional encoding time : 0.000
% 0.20/0.57 # Propositional solver time : 0.000
% 0.20/0.57 # Success case prop preproc time : 0.000
% 0.20/0.57 # Success case prop encoding time : 0.000
% 0.20/0.57 # Success case prop solver time : 0.000
% 0.20/0.57 # Current number of processed clauses : 259
% 0.20/0.57 # Positive orientable unit clauses : 48
% 0.20/0.57 # Positive unorientable unit clauses: 0
% 0.20/0.57 # Negative unit clauses : 68
% 0.20/0.57 # Non-unit-clauses : 143
% 0.20/0.57 # Current number of unprocessed clauses: 663
% 0.20/0.57 # ...number of literals in the above : 2007
% 0.20/0.57 # Current number of archived formulas : 0
% 0.20/0.57 # Current number of archived clauses : 42
% 0.20/0.57 # Clause-clause subsumption calls (NU) : 4449
% 0.20/0.57 # Rec. Clause-clause subsumption calls : 3001
% 0.20/0.57 # Non-unit clause-clause subsumptions : 101
% 0.20/0.57 # Unit Clause-clause subsumption calls : 2213
% 0.20/0.57 # Rewrite failures with RHS unbound : 0
% 0.20/0.57 # BW rewrite match attempts : 33
% 0.20/0.57 # BW rewrite match successes : 5
% 0.20/0.57 # Condensation attempts : 0
% 0.20/0.57 # Condensation successes : 0
% 0.20/0.57 # Termbank termtop insertions : 21898
% 0.20/0.57 # Search garbage collected termcells : 1585
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.051 s
% 0.20/0.57 # System time : 0.010 s
% 0.20/0.57 # Total time : 0.061 s
% 0.20/0.57 # Maximum resident set size: 2080 pages
% 0.20/0.57
% 0.20/0.57 # -------------------------------------------------
% 0.20/0.57 # User time : 0.210 s
% 0.20/0.57 # System time : 0.024 s
% 0.20/0.57 # Total time : 0.234 s
% 0.20/0.57 # Maximum resident set size: 1796 pages
% 0.20/0.57 % E---3.1 exiting
% 0.76/0.57 % E exiting
%------------------------------------------------------------------------------