TSTP Solution File: SWV452+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV452+1 : TPTP v8.1.2. Released v4.0.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:59:34 EDT 2023
% Result : Theorem 21.89s 3.18s
% Output : CNFRefutation 21.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 40 ( 15 unt; 0 def)
% Number of atoms : 282 ( 121 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 385 ( 143 ~; 94 |; 101 &)
% ( 2 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 24 ( 24 usr; 16 con; 0-2 aty)
% Number of variables : 157 ( 22 sgn; 110 !; 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_Down(X6),X12) )
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ( ! [X7] :
( host(X5) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X5) = host(X13) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X5) != host(X18)
=> ! [X19] :
( ( ( ( X7 != X5
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X5
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X19),X12)
& elem(m_Down(X17),queue(host(X18))) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zmBFxcV7lL/E---3.1_10398.p',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zmBFxcV7lL/E---3.1_10398.p',axiom_46) ).
fof(c_0_2,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
<=> ( ! [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_Down(X6),X12) ) ),
introduced(definition) ).
fof(c_0_3,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_3(X12,X6,X5)
=> ( setIn(X5,alive)
=> ( ~ leq(host(X5),host(X6))
=> ( ( ( index(ldr,host(X5)) = host(X6)
& index(status,host(X5)) = norm )
| ( index(status,host(X5)) = wait
& host(X6) = host(index(elid,host(X5))) ) )
=> ( ( ! [X7] :
( host(X5) = host(X7)
=> leq(X7,X13) )
& ~ setIn(X13,pids)
& host(X5) = host(X13) )
=> ( host(X13) != s(zero)
=> ! [X7] :
( host(X5) = host(X7)
=> ! [X17,X18] :
( host(X5) != host(X18)
=> ! [X19] :
( ( ( ( X7 != X5
& setIn(X7,alive) )
| X7 = X13 )
& ( ( X18 != X5
& setIn(X18,alive) )
| X18 = X13 )
& host(X18) != host(X7)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X19),X12)
& elem(m_Down(X17),queue(host(X18))) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_2]) ).
fof(c_0_4,plain,
! [X5,X6,X12] :
( epred1_3(X12,X6,X5)
=> ( ! [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_Down(X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
! [X153] :
( epred1_3(esk5_0,esk8_0,esk7_0)
& setIn(esk7_0,alive)
& ~ leq(host(esk7_0),host(esk8_0))
& ( index(status,host(esk7_0)) = wait
| index(ldr,host(esk7_0)) = host(esk8_0) )
& ( host(esk8_0) = host(index(elid,host(esk7_0)))
| index(ldr,host(esk7_0)) = host(esk8_0) )
& ( index(status,host(esk7_0)) = wait
| index(status,host(esk7_0)) = norm )
& ( host(esk8_0) = host(index(elid,host(esk7_0)))
| index(status,host(esk7_0)) = norm )
& ( host(esk7_0) != host(X153)
| leq(X153,esk6_0) )
& ~ setIn(esk6_0,pids)
& host(esk7_0) = host(esk6_0)
& host(esk6_0) != s(zero)
& host(esk7_0) = host(esk9_0)
& host(esk7_0) != host(esk11_0)
& ( esk9_0 != esk7_0
| esk9_0 = esk6_0 )
& ( setIn(esk9_0,alive)
| esk9_0 = esk6_0 )
& ( esk11_0 != esk7_0
| esk11_0 = esk6_0 )
& ( setIn(esk11_0,alive)
| esk11_0 = esk6_0 )
& host(esk11_0) != host(esk9_0)
& host(esk10_0) = host(esk9_0)
& host(esk12_0) = host(esk11_0)
& elem(m_Down(esk12_0),esk5_0)
& elem(m_Down(esk10_0),queue(host(esk11_0))) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179] :
( ( ~ setIn(X162,alive)
| ~ elem(m_Down(X162),queue(host(X161)))
| ~ epred1_3(X160,X159,X158) )
& ( ~ elem(m_Down(X164),queue(host(X163)))
| ~ setIn(X164,alive)
| ~ epred1_3(X160,X159,X158) )
& ( ~ elem(m_Down(X166),queue(host(X165)))
| host(X166) != host(X165)
| ~ epred1_3(X160,X159,X158) )
& ( ~ elem(m_Halt(X168),queue(host(X167)))
| ~ leq(host(X167),host(X168))
| ~ epred1_3(X160,X159,X158) )
& ( ~ elem(m_Ack(X171,X169),queue(host(X170)))
| ~ leq(host(X169),host(X171))
| ~ epred1_3(X160,X159,X158) )
& ( setIn(X172,alive)
| ~ leq(X173,X172)
| host(X173) != host(X172)
| ~ setIn(X173,alive)
| ~ epred1_3(X160,X159,X158) )
& ( X175 = X174
| host(X175) != host(X174)
| ~ setIn(X174,alive)
| ~ setIn(X175,alive)
| ~ epred1_3(X160,X159,X158) )
& ( host(X178) = host(X176)
| ~ setIn(X176,alive)
| ~ setIn(X178,alive)
| host(X177) != host(X176)
| host(X179) != host(X178)
| ~ elem(m_Down(X179),queue(host(X176)))
| ~ elem(m_Down(X177),queue(host(X178)))
| ~ epred1_3(X160,X159,X158) )
& ( queue(host(X158)) = cons(m_Down(X159),X160)
| ~ epred1_3(X160,X159,X158) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_7,negated_conjecture,
host(esk10_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
host(esk7_0) = host(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
epred1_3(esk5_0,esk8_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( setIn(X1,alive)
| ~ leq(X2,X1)
| host(X2) != host(X1)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,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_3(X5,X6,X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
elem(m_Down(esk10_0),queue(host(esk11_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
host(esk10_0) = host(esk7_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( setIn(X1,alive)
| host(X1) != host(X2)
| ~ leq(X2,X1)
| ~ setIn(X2,alive) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( host(X1) = host(esk11_0)
| host(esk11_0) != host(X2)
| host(X1) != host(esk7_0)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(esk11_0,alive)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
queue(host(esk7_0)) = cons(m_Down(esk8_0),esk5_0),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_21,negated_conjecture,
host(esk7_0) != host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_22,plain,
! [X100,X101,X102] :
( ( ~ elem(X100,cons(X101,X102))
| X100 = X101
| elem(X100,X102) )
& ( X100 != X101
| elem(X100,cons(X101,X102)) )
& ( ~ elem(X100,X102)
| elem(X100,cons(X101,X102)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).
cnf(c_0_23,negated_conjecture,
( X1 = esk7_0
| host(X1) != host(esk7_0)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( setIn(X1,alive)
| host(X1) != host(esk7_0)
| ~ leq(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( host(esk11_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk11_0,alive)
| ~ elem(m_Down(X1),cons(m_Down(esk8_0),esk5_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]),c_0_21]) ).
cnf(c_0_26,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( X1 = esk7_0
| host(X1) != host(esk7_0)
| ~ leq(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( leq(X1,esk6_0)
| host(esk7_0) != host(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,negated_conjecture,
host(esk7_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_30,negated_conjecture,
( host(esk11_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ setIn(esk11_0,alive)
| ~ elem(m_Down(X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
elem(m_Down(esk12_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,negated_conjecture,
host(esk12_0) = host(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
( setIn(esk11_0,alive)
| esk11_0 = esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_34,negated_conjecture,
esk6_0 = esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| ~ setIn(esk11_0,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
( esk11_0 = esk7_0
| setIn(esk11_0,alive) ),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ setIn(esk11_0,alive),
inference(spm,[status(thm)],[c_0_35,c_0_10]) ).
cnf(c_0_38,negated_conjecture,
esk11_0 = esk7_0,
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV452+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:02:06 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.17/0.42 Running first-order model finding
% 0.17/0.42 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.zmBFxcV7lL/E---3.1_10398.p
% 21.89/3.18 # Version: 3.1pre001
% 21.89/3.18 # Preprocessing class: FSLSSMSMSSSNFFN.
% 21.89/3.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.89/3.18 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 21.89/3.18 # Starting new_bool_3 with 300s (1) cores
% 21.89/3.18 # Starting new_bool_1 with 300s (1) cores
% 21.89/3.18 # Starting sh5l with 300s (1) cores
% 21.89/3.18 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10475 completed with status 0
% 21.89/3.18 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 21.89/3.18 # Preprocessing class: FSLSSMSMSSSNFFN.
% 21.89/3.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.89/3.18 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 21.89/3.18 # No SInE strategy applied
% 21.89/3.18 # Search class: FGHSM-FFMM21-MFFFFFNN
% 21.89/3.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 21.89/3.18 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 21.89/3.18 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 21.89/3.18 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 21.89/3.18 # Starting new_bool_3 with 136s (1) cores
% 21.89/3.18 # Starting new_bool_1 with 136s (1) cores
% 21.89/3.18 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 10483 completed with status 0
% 21.89/3.18 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 21.89/3.18 # Preprocessing class: FSLSSMSMSSSNFFN.
% 21.89/3.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.89/3.18 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 21.89/3.18 # No SInE strategy applied
% 21.89/3.18 # Search class: FGHSM-FFMM21-MFFFFFNN
% 21.89/3.18 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 21.89/3.18 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 21.89/3.18 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 21.89/3.18 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 21.89/3.18 # Preprocessing time : 0.005 s
% 21.89/3.18
% 21.89/3.18 # Proof found!
% 21.89/3.18 # SZS status Theorem
% 21.89/3.18 # SZS output start CNFRefutation
% See solution above
% 21.89/3.18 # Parsed axioms : 67
% 21.89/3.18 # Removed by relevancy pruning/SinE : 0
% 21.89/3.18 # Initial clauses : 127
% 21.89/3.18 # Removed in clause preprocessing : 6
% 21.89/3.18 # Initial clauses in saturation : 121
% 21.89/3.18 # Processed clauses : 5080
% 21.89/3.18 # ...of these trivial : 98
% 21.89/3.18 # ...subsumed : 3360
% 21.89/3.18 # ...remaining for further processing : 1622
% 21.89/3.18 # Other redundant clauses eliminated : 20
% 21.89/3.18 # Clauses deleted for lack of memory : 0
% 21.89/3.18 # Backward-subsumed : 165
% 21.89/3.18 # Backward-rewritten : 66
% 21.89/3.18 # Generated clauses : 135300
% 21.89/3.18 # ...of the previous two non-redundant : 113217
% 21.89/3.18 # ...aggressively subsumed : 0
% 21.89/3.18 # Contextual simplify-reflections : 35
% 21.89/3.18 # Paramodulations : 134995
% 21.89/3.18 # Factorizations : 193
% 21.89/3.18 # NegExts : 0
% 21.89/3.18 # Equation resolutions : 111
% 21.89/3.18 # Total rewrite steps : 29162
% 21.89/3.18 # Propositional unsat checks : 0
% 21.89/3.18 # Propositional check models : 0
% 21.89/3.18 # Propositional check unsatisfiable : 0
% 21.89/3.18 # Propositional clauses : 0
% 21.89/3.18 # Propositional clauses after purity: 0
% 21.89/3.18 # Propositional unsat core size : 0
% 21.89/3.18 # Propositional preprocessing time : 0.000
% 21.89/3.18 # Propositional encoding time : 0.000
% 21.89/3.18 # Propositional solver time : 0.000
% 21.89/3.18 # Success case prop preproc time : 0.000
% 21.89/3.18 # Success case prop encoding time : 0.000
% 21.89/3.18 # Success case prop solver time : 0.000
% 21.89/3.18 # Current number of processed clauses : 1386
% 21.89/3.18 # Positive orientable unit clauses : 81
% 21.89/3.18 # Positive unorientable unit clauses: 0
% 21.89/3.18 # Negative unit clauses : 131
% 21.89/3.18 # Non-unit-clauses : 1174
% 21.89/3.18 # Current number of unprocessed clauses: 107648
% 21.89/3.18 # ...number of literals in the above : 432577
% 21.89/3.18 # Current number of archived formulas : 0
% 21.89/3.18 # Current number of archived clauses : 232
% 21.89/3.18 # Clause-clause subsumption calls (NU) : 246012
% 21.89/3.18 # Rec. Clause-clause subsumption calls : 142029
% 21.89/3.18 # Non-unit clause-clause subsumptions : 2338
% 21.89/3.18 # Unit Clause-clause subsumption calls : 23460
% 21.89/3.18 # Rewrite failures with RHS unbound : 0
% 21.89/3.18 # BW rewrite match attempts : 197
% 21.89/3.18 # BW rewrite match successes : 14
% 21.89/3.18 # Condensation attempts : 0
% 21.89/3.18 # Condensation successes : 0
% 21.89/3.18 # Termbank termtop insertions : 1824632
% 21.89/3.18
% 21.89/3.18 # -------------------------------------------------
% 21.89/3.18 # User time : 2.618 s
% 21.89/3.18 # System time : 0.080 s
% 21.89/3.18 # Total time : 2.698 s
% 21.89/3.18 # Maximum resident set size: 2112 pages
% 21.89/3.18
% 21.89/3.18 # -------------------------------------------------
% 21.89/3.18 # User time : 13.207 s
% 21.89/3.18 # System time : 0.236 s
% 21.89/3.18 # Total time : 13.443 s
% 21.89/3.18 # Maximum resident set size: 1768 pages
% 21.89/3.18 % E---3.1 exiting
%------------------------------------------------------------------------------