%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : 600s
% DateTime : Wed Jul 20 18:16:52 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 18 unt; 0 def)
% Number of atoms : 254 ( 98 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 358 ( 140 ~; 80 |; 93 &)
% ( 2 <=>; 43 =>; 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 : 25 ( 25 usr; 17 con; 0-2 aty)
% Number of variables : 157 ( 27 sgn 112 !; 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] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X17,X18] :
( host(X5) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X7)
& setIn(X7,alive)
& setIn(X18,alive)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X7))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj) ).
fof(axiom_46,axiom,
! [X5,X6,X4] :
( elem(X5,cons(X6,X4))
<=> ( X5 = X6
| elem(X5,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
fof(c_0_2,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
<=> ( ! [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(X5,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] :
( ( ~ leq(host(X5),X7)
& leq(s(zero),X7) )
=> ( setIn(X7,index(down,host(X5)))
| X7 = host(X6) ) )
& index(status,host(X5)) = elec_1 )
=> ! [X7] :
( host(X5) != host(X7)
=> ! [X17,X18] :
( host(X5) = host(X18)
=> ! [X19] :
( ( host(X18) != host(X7)
& setIn(X7,alive)
& setIn(X18,alive)
& host(X17) = host(X7)
& host(X19) = host(X18) )
=> ~ ( elem(m_Down(X17),X12)
& elem(m_Down(X19),queue(host(X7))) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_2]) ).
fof(c_0_4,plain,
! [X12,X6,X5] :
( epred1_3(X5,X6,X12)
=> ( ! [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,
( epred1_3(esk2_0,esk3_0,esk1_0)
& setIn(esk2_0,alive)
& ~ leq(host(esk2_0),host(esk3_0))
& ( index(ldr,host(esk2_0)) != host(esk3_0)
| index(status,host(esk2_0)) != norm )
& ( index(status,host(esk2_0)) != wait
| host(esk3_0) != host(index(elid,host(esk2_0))) )
& ( ~ leq(host(esk2_0),esk4_0)
| index(status,host(esk2_0)) != elec_1 )
& ( leq(s(zero),esk4_0)
| index(status,host(esk2_0)) != elec_1 )
& ( ~ setIn(esk4_0,index(down,host(esk2_0)))
| index(status,host(esk2_0)) != elec_1 )
& ( esk4_0 != host(esk3_0)
| index(status,host(esk2_0)) != elec_1 )
& host(esk2_0) != host(esk5_0)
& host(esk2_0) = host(esk7_0)
& host(esk7_0) != host(esk5_0)
& setIn(esk5_0,alive)
& setIn(esk7_0,alive)
& host(esk6_0) = host(esk5_0)
& host(esk8_0) = host(esk7_0)
& elem(m_Down(esk6_0),esk1_0)
& elem(m_Down(esk8_0),queue(host(esk5_0))) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])])])]) ).
fof(c_0_6,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38] :
( ( ~ setIn(X21,alive)
| ~ elem(m_Down(X21),queue(host(X20)))
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Down(X23),queue(host(X22)))
| ~ setIn(X23,alive)
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Down(X25),queue(host(X24)))
| host(X25) != host(X24)
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Halt(X27),queue(host(X26)))
| ~ leq(host(X26),host(X27))
| ~ epred1_3(X19,X18,X17) )
& ( ~ elem(m_Ack(X30,X28),queue(host(X29)))
| ~ leq(host(X28),host(X30))
| ~ epred1_3(X19,X18,X17) )
& ( setIn(X31,alive)
| ~ leq(X32,X31)
| host(X32) != host(X31)
| ~ setIn(X32,alive)
| ~ epred1_3(X19,X18,X17) )
& ( X34 = X33
| host(X34) != host(X33)
| ~ setIn(X33,alive)
| ~ setIn(X34,alive)
| ~ epred1_3(X19,X18,X17) )
& ( host(X37) = host(X35)
| ~ setIn(X35,alive)
| ~ setIn(X37,alive)
| host(X36) != host(X35)
| host(X38) != host(X37)
| ~ elem(m_Down(X38),queue(host(X35)))
| ~ elem(m_Down(X36),queue(host(X37)))
| ~ epred1_3(X19,X18,X17) )
& ( queue(host(X19)) = cons(m_Down(X18),X17)
| ~ epred1_3(X19,X18,X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
host(esk2_0) = host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
host(esk8_0) = host(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
epred1_3(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
host(esk2_0) = host(esk8_0),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( host(X5) = host(X7)
| ~ epred1_3(X1,X2,X3)
| ~ elem(m_Down(X4),queue(host(X5)))
| ~ elem(m_Down(X6),queue(host(X7)))
| host(X6) != host(X5)
| host(X4) != host(X7)
| ~ setIn(X5,alive)
| ~ setIn(X7,alive) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
setIn(esk7_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
queue(host(esk8_0)) = cons(m_Down(esk3_0),esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
fof(c_0_15,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( ~ elem(X7,cons(X8,X9))
| X7 = X8
| elem(X7,X9) )
& ( X7 != X8
| elem(X7,cons(X8,X9)) )
& ( ~ elem(X7,X9)
| elem(X7,cons(X8,X9)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])])]) ).
cnf(c_0_16,plain,
( X4 = X5
| ~ epred1_3(X1,X2,X3)
| ~ setIn(X4,alive)
| ~ setIn(X5,alive)
| host(X4) != host(X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( host(X1) = host(esk8_0)
| host(X2) != host(esk8_0)
| host(X1) != host(X3)
| ~ epred1_3(X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X3),cons(m_Down(esk3_0),esk1_0))
| ~ elem(m_Down(X2),queue(host(X1))) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
host(esk7_0) != host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
host(esk6_0) = host(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( host(X1) = host(esk8_0)
| host(X2) != host(esk8_0)
| host(X1) != host(X3)
| ~ epred1_3(X4,X5,X6)
| ~ setIn(X1,alive)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X3),esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
setIn(esk5_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
host(esk8_0) != host(esk6_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_8]) ).
cnf(c_0_25,negated_conjecture,
elem(m_Down(esk8_0),queue(host(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,negated_conjecture,
( X1 = esk7_0
| host(X1) != host(esk8_0)
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_8]) ).
cnf(c_0_27,negated_conjecture,
setIn(esk2_0,alive),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,negated_conjecture,
( host(X1) != host(esk8_0)
| host(esk6_0) != host(X2)
| ~ epred1_3(X3,X4,X5)
| ~ elem(m_Down(X1),queue(host(esk6_0)))
| ~ elem(m_Down(X2),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_23])]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
elem(m_Down(esk8_0),queue(host(esk6_0))),
inference(rw,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
esk2_0 = esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_11])]) ).
cnf(c_0_31,negated_conjecture,
( host(esk6_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
elem(m_Down(esk6_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
epred1_3(esk7_0,esk3_0,esk1_0),
inference(rw,[status(thm)],[c_0_10,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
~ epred1_3(X1,X2,X3),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 19:52:09 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.020 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 36
% 0.26/1.44 # Proof object clause steps : 28
% 0.26/1.44 # Proof object formula steps : 8
% 0.26/1.44 # Proof object conjectures : 27
% 0.26/1.44 # Proof object clause conjectures : 24
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 14
% 0.26/1.44 # Proof object initial formulas used : 2
% 0.26/1.44 # Proof object generating inferences : 9
% 0.26/1.44 # Proof object simplifying inferences : 16
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 67
% 0.26/1.44 # Removed by relevancy pruning/SinE : 16
% 0.26/1.44 # Initial clauses : 92
% 0.26/1.44 # Removed in clause preprocessing : 6
% 0.26/1.44 # Initial clauses in saturation : 86
% 0.26/1.44 # Processed clauses : 1973
% 0.26/1.44 # ...of these trivial : 25
% 0.26/1.44 # ...subsumed : 1170
% 0.26/1.44 # ...remaining for further processing : 778
% 0.26/1.44 # Other redundant clauses eliminated : 54
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 172
% 0.26/1.44 # Backward-rewritten : 26
% 0.26/1.44 # Generated clauses : 32774
% 0.26/1.44 # ...of the previous two non-trivial : 31040
% 0.26/1.44 # Contextual simplify-reflections : 644
% 0.26/1.44 # Paramodulations : 32650
% 0.26/1.44 # Factorizations : 47
% 0.26/1.44 # Equation resolutions : 74
% 0.26/1.44 # Current number of processed clauses : 573
% 0.26/1.44 # Positive orientable unit clauses : 45
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 78
% 0.26/1.44 # Non-unit-clauses : 450
% 0.26/1.44 # Current number of unprocessed clauses: 19296
% 0.26/1.44 # ...number of literals in the above : 63463
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 201
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 53525
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 43459
% 0.26/1.44 # Non-unit clause-clause subsumptions : 1696
% 0.26/1.44 # Unit Clause-clause subsumption calls : 1004
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 61
% 0.26/1.44 # BW rewrite match successes : 10
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 372532
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.815 s
% 0.26/1.44 # System time : 0.008 s
% 0.26/1.44 # Total time : 0.823 s
% 0.26/1.44 # Maximum resident set size: 18032 pages
%------------------------------------------------------------------------------