TSTP Solution File: SWV454+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV454+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n029.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:20 EDT 2022
% Result : Theorem 69.30s 9.19s
% Output : Proof 69.30s
% 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/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g1,plain,
setIn(sK5,alive),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g2,plain,
sPE(host(sK5),host(sK7)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g3,plain,
~ sPE(host(sK5),host(sK9)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g4,plain,
setIn(sK9,alive),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g5,plain,
sPE(host(sK8),host(sK7)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g6,plain,
sPE(host(sK10),host(sK9)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g7,plain,
elem(m_Down(sK10),sK3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g8,plain,
elem(m_Down(sK8),queue(host(sK9))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g9,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(g10,plain,
( ~ sPE(host(sK5),host(sK7))
| sPE(host(sK7),host(sK5)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_01)]) ).
cnf(g11,plain,
( ~ sPE(host(sK9),host(sK5))
| sPE(host(sK5),host(sK9)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_32)]) ).
cnf(g12,plain,
( ~ sPE(host(sK8),host(sK5))
| ~ sPE(host(sK10),host(sK9))
| ~ elem(m_Down(sK8),queue(host(sK9)))
| ~ elem(m_Down(sK10),queue(host(sK5)))
| ~ setIn(sK5,alive)
| ~ setIn(sK9,alive)
| sPE(host(sK9),host(sK5)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_61)]) ).
cnf(g13,plain,
( ~ sPE(host(sK8),host(sK7))
| ~ sPE(host(sK7),host(sK5))
| sPE(host(sK8),host(sK5)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_29)]) ).
cnf(g14,plain,
sPE(m_Down(sK10),m_Down(sK10)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)]) ).
cnf(g15,plain,
( ~ elem(m_Down(sK10),sK3)
| elem(m_Down(sK10),cons(m_Down(sK6),sK3)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(m_Down(sK10),m_Down(sK10))
| ~ sPE(cons(m_Down(sK6),sK3),queue(host(sK5)))
| ~ elem(m_Down(sK10),cons(m_Down(sK6),sK3))
| elem(m_Down(sK10),queue(host(sK5))) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_28)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV454+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n029.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 : Wed Jun 15 14:26:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 69.30/9.19 % symbols: 50
% 69.30/9.19 % clauses: 151
% 69.30/9.19 % start clauses: 27
% 69.30/9.19 % iterative deepening steps: 3840
% 69.30/9.19 % maximum path limit: 3
% 69.30/9.19 % literal attempts: 39187197
% 69.30/9.19 % depth failures: 36234070
% 69.30/9.19 % regularity failures: 846209
% 69.30/9.19 % tautology failures: 284183
% 69.30/9.19 % reductions: 95531
% 69.30/9.19 % extensions: 38998984
% 69.30/9.19 % SAT variables: 790733
% 69.30/9.19 % SAT clauses: 855903
% 69.30/9.19 % WalkSAT solutions: 855859
% 69.30/9.19 % CDCL solutions: 33
% 69.30/9.19 % SZS status Theorem for theBenchmark
% 69.30/9.19 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------