TSTP Solution File: SWV448+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n013.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 21:29:19 EDT 2022
% Result : Theorem 124.20s 16.06s
% Output : Proof 124.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sPE(queue(host(sK5)),cons(m_Down(sK6),sK3)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g1,plain,
sPE(index(status,host(sK5)),elec_1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g2,plain,
leq(nbr_proc,host(sK5)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g3,plain,
~ sPE(host(sK5),host(sK10)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g4,plain,
setIn(sK10,alive),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g5,plain,
sPE(index(ldr,host(sK10)),host(sK10)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g6,plain,
sPE(index(status,host(sK10)),norm),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g7,plain,
( ~ sPE(queue(host(sK5)),cons(m_Down(sK6),sK3))
| sPE(cons(m_Down(sK6),sK3),queue(host(sK5))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ leq(host(sK5),host(sK10))
| ~ leq(host(sK10),host(sK5))
| sPE(host(sK5),host(sK10)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_30)]) ).
cnf(g9,plain,
( ~ sPE(index(status,host(sK10)),norm)
| ~ sPE(index(status,host(sK5)),elec_1)
| ~ sPE(index(ldr,host(sK10)),host(sK10))
| ~ sPE(sK7(sK10,sK6,sK5),host(sK6))
| ~ elem(m_Down(sK6),queue(host(sK5)))
| ~ setIn(sK10,alive)
| leq(host(sK5),host(sK10)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_28)]) ).
cnf(g10,plain,
( ~ leq(s(zero),sK7(sK10,sK6,sK5))
| sPE(sK7(sK10,sK6,sK5),host(sK6))
| setIn(sK7(sK10,sK6,sK5),index(down,host(sK5)))
| leq(host(sK5),sK7(sK10,sK6,sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g11,plain,
( ~ sPE(index(status,host(sK10)),norm)
| ~ sPE(index(status,host(sK5)),elec_1)
| ~ sPE(index(ldr,host(sK10)),host(sK10))
| ~ elem(m_Down(sK6),queue(host(sK5)))
| ~ setIn(sK10,alive)
| ~ setIn(sK7(sK10,sK6,sK5),index(down,host(sK5)))
| leq(host(sK5),host(sK10)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
leq(host(sK10),nbr_proc),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_62)]) ).
cnf(g13,plain,
( ~ sPE(index(status,host(sK10)),norm)
| ~ sPE(index(status,host(sK5)),elec_1)
| ~ sPE(index(ldr,host(sK10)),host(sK10))
| ~ elem(m_Down(sK6),queue(host(sK5)))
| ~ setIn(sK10,alive)
| leq(host(sK5),host(sK10))
| leq(s(zero),sK7(sK10,sK6,sK5)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_64)]) ).
cnf(g14,plain,
( ~ sPE(last(snoc(status,m_Down(sK6))),m_Down(sK6))
| ~ sPE(cons(m_Down(sK6),sK3),queue(host(sK5)))
| ~ elem(last(snoc(status,m_Down(sK6))),cons(m_Down(sK6),sK3))
| elem(m_Down(sK6),queue(host(sK5))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g15,plain,
sPE(last(snoc(status,m_Down(sK6))),m_Down(sK6)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(last(snoc(status,m_Down(sK6))),m_Down(sK6))
| elem(last(snoc(status,m_Down(sK6))),cons(m_Down(sK6),sK3)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_37)]) ).
cnf(g17,plain,
( ~ sPE(index(status,host(sK10)),norm)
| ~ sPE(index(status,host(sK5)),elec_1)
| ~ sPE(index(ldr,host(sK10)),host(sK10))
| ~ elem(m_Down(sK6),queue(host(sK5)))
| ~ setIn(sK10,alive)
| ~ leq(host(sK5),sK7(sK10,sK6,sK5))
| leq(host(sK5),host(sK10)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ leq(host(sK10),nbr_proc)
| ~ leq(nbr_proc,host(sK5))
| leq(host(sK10),host(sK5)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_62)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 01:53:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 124.20/16.06 % symbols: 51
% 124.20/16.06 % clauses: 153
% 124.20/16.06 % start clauses: 28
% 124.20/16.06 % iterative deepening steps: 4639
% 124.20/16.06 % maximum path limit: 3
% 124.20/16.06 % literal attempts: 70480271
% 124.20/16.06 % depth failures: 65875050
% 124.20/16.06 % regularity failures: 1224240
% 124.20/16.06 % tautology failures: 461116
% 124.20/16.06 % reductions: 271995
% 124.20/16.06 % extensions: 70089177
% 124.20/16.06 % SAT variables: 1050904
% 124.20/16.06 % SAT clauses: 1081623
% 124.20/16.06 % WalkSAT solutions: 1081571
% 124.20/16.06 % CDCL solutions: 41
% 124.20/16.06 % SZS status Theorem for theBenchmark
% 124.20/16.06 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------