TSTP Solution File: SWV449+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWV449+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n023.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 Jun 24 17:02:39 EDT 2024
% Result : Theorem 0.61s 0.57s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 24 unt; 0 def)
% Number of atoms : 251 ( 97 equ)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 327 ( 119 ~; 69 |; 91 &)
% ( 3 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-2 aty)
% Number of variables : 169 ( 24 sgn 124 !; 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(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.eFBzxy987i/E---3.1_14594.p',conj) ).
fof(axiom_18,axiom,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
file('/export/starexec/sandbox2/tmp/tmp.eFBzxy987i/E---3.1_14594.p',axiom_18) ).
fof(axiom_47,axiom,
! [X5,X6,X4] :
( elem(X5,snoc(X4,X6))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.eFBzxy987i/E---3.1_14594.p',axiom_47) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.eFBzxy987i/E---3.1_14594.p',axiom_46) ).
fof(c_0_4,plain,
! [X5,X6,X13,X12] :
( epred1_4(X12,X13,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_Ack(X13,X6),X12) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ! [X12,X13,X5,X6] :
( epred1_4(X12,X13,X6,X5)
=> ( 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(X18),queue(host(X19)))
& elem(m_Down(X20),snoc(X12,m_Ldr(X5))) ) ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_4]) ).
fof(c_0_6,plain,
! [X5,X6] : m_Down(X5) != m_Ldr(X6),
inference(fof_simplification,[status(thm)],[axiom_18]) ).
fof(c_0_7,plain,
! [X34,X35,X36] :
( ( ~ elem(X34,snoc(X36,X35))
| X34 = X35
| elem(X34,X36) )
& ( X34 != X35
| elem(X34,snoc(X36,X35)) )
& ( ~ elem(X34,X36)
| elem(X34,snoc(X36,X35)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])]) ).
fof(c_0_8,negated_conjecture,
( epred1_4(esk1_0,esk2_0,esk4_0,esk3_0)
& setIn(esk3_0,alive)
& index(elid,host(esk3_0)) = esk2_0
& index(status,host(esk3_0)) = elec_2
& host(esk4_0) = index(pendack,host(esk3_0))
& leq(nbr_proc,index(pendack,host(esk3_0)))
& ( setIn(host(esk5_0),index(acks,host(esk3_0)))
| host(esk5_0) = host(esk4_0) )
& host(esk5_0) = host(esk6_0)
& host(esk3_0) = host(esk6_0)
& host(esk5_0) != host(esk8_0)
& host(esk3_0) != host(esk8_0)
& host(esk8_0) != host(esk6_0)
& setIn(esk6_0,alive)
& setIn(esk8_0,alive)
& host(esk7_0) = host(esk6_0)
& host(esk9_0) = host(esk8_0)
& elem(m_Down(esk7_0),queue(host(esk8_0)))
& elem(m_Down(esk9_0),snoc(esk1_0,m_Ldr(esk3_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X49,X50] : m_Down(X49) != m_Ldr(X50),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
! [X5,X6,X13,X12] :
( epred1_4(X12,X13,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_Ack(X13,X6),X12) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X31,X32,X33] :
( ( ~ elem(X31,cons(X32,X33))
| X31 = X32
| elem(X31,X33) )
& ( X31 != X32
| elem(X31,cons(X32,X33)) )
& ( ~ elem(X31,X33)
| elem(X31,cons(X32,X33)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])]) ).
cnf(c_0_12,plain,
( X1 = X3
| elem(X1,X2)
| ~ elem(X1,snoc(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
elem(m_Down(esk9_0),snoc(esk1_0,m_Ldr(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
m_Down(X1) != m_Ldr(X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X126,X127,X128,X129,X130,X131,X132,X133,X134,X135,X136,X137,X138,X139,X140,X141,X142,X143,X144,X145,X146,X147,X148] :
( ( ~ setIn(X131,alive)
| ~ elem(m_Down(X131),queue(host(X130)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( ~ elem(m_Down(X133),queue(host(X132)))
| ~ setIn(X133,alive)
| ~ epred1_4(X129,X128,X127,X126) )
& ( ~ elem(m_Down(X135),queue(host(X134)))
| host(X135) != host(X134)
| ~ epred1_4(X129,X128,X127,X126) )
& ( ~ elem(m_Halt(X137),queue(host(X136)))
| ~ leq(host(X136),host(X137))
| ~ epred1_4(X129,X128,X127,X126) )
& ( ~ elem(m_Ack(X140,X138),queue(host(X139)))
| ~ leq(host(X138),host(X140))
| ~ epred1_4(X129,X128,X127,X126) )
& ( setIn(X141,alive)
| ~ leq(X142,X141)
| host(X142) != host(X141)
| ~ setIn(X142,alive)
| ~ epred1_4(X129,X128,X127,X126) )
& ( X144 = X143
| host(X144) != host(X143)
| ~ setIn(X143,alive)
| ~ setIn(X144,alive)
| ~ epred1_4(X129,X128,X127,X126) )
& ( host(X147) = host(X145)
| ~ setIn(X145,alive)
| ~ setIn(X147,alive)
| host(X146) != host(X145)
| host(X148) != host(X147)
| ~ elem(m_Down(X148),queue(host(X145)))
| ~ elem(m_Down(X146),queue(host(X147)))
| ~ epred1_4(X129,X128,X127,X126) )
& ( queue(host(X126)) = cons(m_Ack(X128,X127),X129)
| ~ epred1_4(X129,X128,X127,X126) ) ),
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])])])])]) ).
cnf(c_0_16,plain,
( elem(X1,cons(X3,X2))
| ~ elem(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
elem(m_Down(esk9_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
| ~ epred1_4(X4,X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
epred1_4(esk1_0,esk2_0,esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
host(esk3_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_4(X3,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
elem(m_Down(esk9_0),cons(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
cons(m_Ack(esk2_0,esk4_0),esk1_0) = queue(host(esk6_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
setIn(esk6_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,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_15]) ).
cnf(c_0_27,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
host(esk3_0) != host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
host(esk9_0) = host(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,negated_conjecture,
( X1 = esk6_0
| host(X1) != host(esk6_0)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
setIn(esk3_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,plain,
( host(X1) = host(esk6_0)
| host(esk6_0) != host(X2)
| host(X1) != host(esk9_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(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]) ).
cnf(c_0_33,negated_conjecture,
setIn(esk8_0,alive),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
host(esk9_0) != host(esk6_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_20]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk8_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
esk3_0 = esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_20])]) ).
cnf(c_0_37,negated_conjecture,
( host(esk6_0) != host(X1)
| ~ epred1_4(X2,X3,X4,X5)
| ~ elem(m_Down(X1),queue(host(esk9_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_33])]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
elem(m_Down(esk7_0),queue(host(esk9_0))),
inference(rw,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
host(esk7_0) = host(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_40,negated_conjecture,
epred1_4(esk1_0,esk2_0,esk4_0,esk6_0),
inference(rw,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ epred1_4(X1,X2,X3,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_40,c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV449+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 14:13:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.eFBzxy987i/E---3.1_14594.p
% 0.61/0.57 # Version: 3.2.0
% 0.61/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.57 # Starting sh5l with 300s (1) cores
% 0.61/0.57 # new_bool_1 with pid 14678 completed with status 0
% 0.61/0.57 # Result found by new_bool_1
% 0.61/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.61/0.57 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.61/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.57 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.61/0.57 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 14681 completed with status 0
% 0.61/0.57 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.61/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.61/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.61/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.61/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.61/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.61/0.57 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.61/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.61/0.57 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.61/0.57 # Preprocessing time : 0.002 s
% 0.61/0.57
% 0.61/0.57 # Proof found!
% 0.61/0.57 # SZS status Theorem
% 0.61/0.57 # SZS output start CNFRefutation
% See solution above
% 0.61/0.57 # Parsed axioms : 67
% 0.61/0.57 # Removed by relevancy pruning/SinE : 14
% 0.61/0.57 # Initial clauses : 94
% 0.61/0.57 # Removed in clause preprocessing : 6
% 0.61/0.57 # Initial clauses in saturation : 88
% 0.61/0.57 # Processed clauses : 629
% 0.61/0.57 # ...of these trivial : 36
% 0.61/0.57 # ...subsumed : 224
% 0.61/0.57 # ...remaining for further processing : 369
% 0.61/0.57 # Other redundant clauses eliminated : 5
% 0.61/0.57 # Clauses deleted for lack of memory : 0
% 0.61/0.57 # Backward-subsumed : 27
% 0.61/0.57 # Backward-rewritten : 17
% 0.61/0.57 # Generated clauses : 2670
% 0.61/0.57 # ...of the previous two non-redundant : 2107
% 0.61/0.57 # ...aggressively subsumed : 0
% 0.61/0.57 # Contextual simplify-reflections : 0
% 0.61/0.57 # Paramodulations : 2653
% 0.61/0.57 # Factorizations : 2
% 0.61/0.57 # NegExts : 0
% 0.61/0.57 # Equation resolutions : 14
% 0.61/0.57 # Disequality decompositions : 0
% 0.61/0.57 # Total rewrite steps : 737
% 0.61/0.57 # ...of those cached : 562
% 0.61/0.57 # Propositional unsat checks : 0
% 0.61/0.57 # Propositional check models : 0
% 0.61/0.57 # Propositional check unsatisfiable : 0
% 0.61/0.57 # Propositional clauses : 0
% 0.61/0.57 # Propositional clauses after purity: 0
% 0.61/0.57 # Propositional unsat core size : 0
% 0.61/0.57 # Propositional preprocessing time : 0.000
% 0.61/0.57 # Propositional encoding time : 0.000
% 0.61/0.57 # Propositional solver time : 0.000
% 0.61/0.57 # Success case prop preproc time : 0.000
% 0.61/0.57 # Success case prop encoding time : 0.000
% 0.61/0.57 # Success case prop solver time : 0.000
% 0.61/0.57 # Current number of processed clauses : 319
% 0.61/0.57 # Positive orientable unit clauses : 87
% 0.61/0.57 # Positive unorientable unit clauses: 1
% 0.61/0.57 # Negative unit clauses : 28
% 0.61/0.57 # Non-unit-clauses : 203
% 0.61/0.57 # Current number of unprocessed clauses: 1549
% 0.61/0.57 # ...number of literals in the above : 3713
% 0.61/0.57 # Current number of archived formulas : 0
% 0.61/0.57 # Current number of archived clauses : 45
% 0.61/0.57 # Clause-clause subsumption calls (NU) : 7847
% 0.61/0.57 # Rec. Clause-clause subsumption calls : 5944
% 0.61/0.57 # Non-unit clause-clause subsumptions : 218
% 0.61/0.57 # Unit Clause-clause subsumption calls : 272
% 0.61/0.57 # Rewrite failures with RHS unbound : 0
% 0.61/0.57 # BW rewrite match attempts : 69
% 0.61/0.57 # BW rewrite match successes : 10
% 0.61/0.57 # Condensation attempts : 0
% 0.61/0.57 # Condensation successes : 0
% 0.61/0.57 # Termbank termtop insertions : 33227
% 0.61/0.57 # Search garbage collected termcells : 1298
% 0.61/0.57
% 0.61/0.57 # -------------------------------------------------
% 0.61/0.57 # User time : 0.058 s
% 0.61/0.57 # System time : 0.006 s
% 0.61/0.57 # Total time : 0.064 s
% 0.61/0.57 # Maximum resident set size: 2092 pages
% 0.61/0.57
% 0.61/0.57 # -------------------------------------------------
% 0.61/0.57 # User time : 0.061 s
% 0.61/0.57 # System time : 0.008 s
% 0.61/0.57 # Total time : 0.068 s
% 0.61/0.57 # Maximum resident set size: 1772 pages
% 0.61/0.57 % E---3.1 exiting
% 0.82/0.57 % E exiting
%------------------------------------------------------------------------------