TSTP Solution File: SWV455+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n020.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 207.87s 26.45s
% Output : Proof 207.87s
% 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,
setIn(sK5,alive),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g2,plain,
~ sPE(host(sK5),host(sK8)),
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(sK8,alive),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g5,plain,
sPE(host(sK9),host(sK8)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g6,plain,
sPE(host(sK11),host(sK10)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g7,plain,
elem(m_Down(sK9),sK3),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g8,plain,
elem(m_Down(sK11),queue(host(sK8))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/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(sK8),host(sK5))
| sPE(host(sK5),host(sK8)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_32)]) ).
cnf(g11,plain,
( ~ sPE(host(sK5),host(sK10))
| sPE(host(sK10),host(sK5)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(host(sK11),host(sK5))
| ~ sPE(host(sK9),host(sK8))
| ~ elem(m_Down(sK11),queue(host(sK8)))
| ~ elem(m_Down(sK9),queue(host(sK5)))
| ~ setIn(sK5,alive)
| ~ setIn(sK8,alive)
| sPE(host(sK8),host(sK5)) ),
inference(ground_cnf,[],[file('Axioms/SWV011+0.ax',axiom_46)]) ).
cnf(g13,plain,
( ~ sPE(host(sK11),host(sK10))
| ~ sPE(host(sK10),host(sK5))
| sPE(host(sK11),host(sK5)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(m_Down(sK9),m_Down(sK9)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)]) ).
cnf(g15,plain,
( ~ elem(m_Down(sK9),sK3)
| elem(m_Down(sK9),cons(m_Down(sK6),sK3)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(m_Down(sK9),m_Down(sK9))
| ~ sPE(cons(m_Down(sK6),sK3),queue(host(sK5)))
| ~ elem(m_Down(sK9),cons(m_Down(sK6),sK3))
| elem(m_Down(sK9),queue(host(sK5))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV455+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 19:58:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 207.87/26.45 % symbols: 51
% 207.87/26.45 % clauses: 150
% 207.87/26.45 % start clauses: 26
% 207.87/26.45 % iterative deepening steps: 4085
% 207.87/26.45 % maximum path limit: 3
% 207.87/26.45 % literal attempts: 38042350
% 207.87/26.45 % depth failures: 34770781
% 207.87/26.45 % regularity failures: 1013719
% 207.87/26.45 % tautology failures: 294601
% 207.87/26.45 % reductions: 100730
% 207.87/26.45 % extensions: 37850050
% 207.87/26.45 % SAT variables: 1382293
% 207.87/26.45 % SAT clauses: 1483679
% 207.87/26.45 % WalkSAT solutions: 1482685
% 207.87/26.45 % CDCL solutions: 978
% 207.87/26.45 % SZS status Theorem for theBenchmark
% 207.87/26.45 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------