TSTP Solution File: PUZ133+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : PUZ133+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n028.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 : Mon Jul 18 18:26:19 EDT 2022
% Result : Theorem 27.88s 3.96s
% Output : Proof 27.88s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
queens_p,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym)]) ).
cnf(g1,plain,
~ queens_q,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym)]) ).
cnf(g2,plain,
( le(sK0,n)
| queens_q ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q)]) ).
cnf(g3,plain,
( le(sK1,n)
| queens_q ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q)]) ).
cnf(g4,plain,
( le(s(n0),sK0)
| queens_q ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q)]) ).
cnf(g5,plain,
( le(s(sK0),sK1)
| queens_q ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q)]) ).
cnf(g6,plain,
( ~ le(s(sK0),sK1)
| le(s(perm(sK1)),perm(sK0))
| queens_q ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q)]) ).
cnf(g7,plain,
( sPE(plus(q(sK0),sK0),plus(q(sK1),sK1))
| sPE(minus(q(sK0),sK0),minus(q(sK1),sK1))
| sPE(q(sK0),q(sK1))
| queens_q ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_q)]) ).
cnf(g8,plain,
( ~ sPE(minus(p(perm(sK1)),perm(sK1)),minus(p(perm(sK0)),perm(sK0)))
| ~ queens_p
| ~ le(perm(sK1),n)
| ~ le(perm(sK0),n)
| ~ le(s(perm(sK1)),perm(sK0))
| ~ le(s(n0),perm(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p)]) ).
cnf(g9,plain,
sPE(q(sK1),p(perm(sK1))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym)]) ).
cnf(g10,plain,
( ~ sPE(p(perm(sK1)),p(perm(sK0)))
| ~ queens_p
| ~ le(perm(sK1),n)
| ~ le(perm(sK0),n)
| ~ le(s(perm(sK1)),perm(sK0))
| ~ le(s(n0),perm(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p)]) ).
cnf(g11,plain,
( ~ sPE(plus(p(perm(sK1)),perm(sK1)),plus(p(perm(sK0)),perm(sK0)))
| ~ queens_p
| ~ le(perm(sK1),n)
| ~ le(perm(sK0),n)
| ~ le(s(perm(sK1)),perm(sK0))
| ~ le(s(n0),perm(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_p)]) ).
cnf(g12,plain,
( ~ le(sK0,n)
| ~ le(s(n0),sK0)
| le(perm(sK0),n) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_range)]) ).
cnf(g13,plain,
( ~ le(sK1,n)
| ~ le(s(n0),sK1)
| le(s(n0),perm(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_range)]) ).
cnf(g14,plain,
( ~ le(s(perm(sK1)),perm(sK0))
| ~ le(perm(sK0),n)
| le(s(perm(sK1)),n) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',le_trans)]) ).
cnf(g15,plain,
le(perm(sK1),s(perm(sK1))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_le)]) ).
cnf(g16,plain,
sPE(q(sK0),p(perm(sK0))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',queens_sym)]) ).
cnf(g17,plain,
sPE(sK1,sK1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
le(sK0,s(sK0)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_le)]) ).
cnf(g19,plain,
sPE(perm(sK0),perm(sK0)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ le(s(n0),sK0)
| ~ le(sK0,s(sK0))
| le(s(n0),s(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',le_trans)]) ).
cnf(g21,plain,
( ~ sPE(q(sK1),q(sK0))
| ~ sPE(q(sK0),p(perm(sK0)))
| sPE(q(sK1),p(perm(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(q(sK0),q(sK1))
| sPE(q(sK1),q(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(q(sK1),p(perm(sK1)))
| sPE(p(perm(sK1)),q(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(q(sK1),p(perm(sK1)))
| ~ sPE(sK1,sK1)
| sPE(minus(q(sK1),sK1),minus(p(perm(sK1)),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(minus(q(sK0),sK0),minus(q(sK1),sK1))
| ~ sPE(minus(q(sK1),sK1),minus(p(perm(sK1)),sK1))
| sPE(minus(q(sK0),sK0),minus(p(perm(sK1)),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ le(s(n0),s(sK0))
| ~ le(s(sK0),sK1)
| le(s(n0),sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',le_trans)]) ).
cnf(g27,plain,
( ~ sPE(q(sK1),p(perm(sK1)))
| ~ sPE(sK1,sK1)
| sPE(plus(q(sK1),sK1),plus(p(perm(sK1)),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(plus(q(sK0),sK0),plus(q(sK1),sK1))
| ~ sPE(plus(q(sK1),sK1),plus(p(perm(sK1)),sK1))
| sPE(plus(q(sK0),sK0),plus(p(perm(sK1)),sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ le(perm(sK1),s(perm(sK1)))
| ~ le(s(perm(sK1)),n)
| le(perm(sK1),n) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',le_trans)]) ).
cnf(g30,plain,
( ~ sPE(p(perm(sK1)),q(sK1))
| ~ sPE(q(sK1),p(perm(sK0)))
| sPE(p(perm(sK1)),p(perm(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
( ~ sPE(minus(p(perm(sK1)),perm(sK1)),minus(q(sK0),perm(sK0)))
| ~ sPE(minus(q(sK0),perm(sK0)),minus(p(perm(sK0)),perm(sK0)))
| sPE(minus(p(perm(sK1)),perm(sK1)),minus(p(perm(sK0)),perm(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g32,plain,
( ~ sPE(q(sK0),p(perm(sK0)))
| ~ sPE(perm(sK0),perm(sK0))
| sPE(minus(q(sK0),perm(sK0)),minus(p(perm(sK0)),perm(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g33,plain,
( ~ sPE(minus(q(sK0),perm(sK0)),minus(p(perm(sK1)),perm(sK1)))
| sPE(minus(p(perm(sK1)),perm(sK1)),minus(q(sK0),perm(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g34,plain,
( ~ sPE(minus(q(sK0),p(perm(sK1))),minus(perm(sK0),perm(sK1)))
| sPE(minus(q(sK0),perm(sK0)),minus(p(perm(sK1)),perm(sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',minus1)]) ).
cnf(g35,plain,
( ~ sPE(plus(p(perm(sK1)),perm(sK1)),plus(q(sK0),perm(sK0)))
| ~ sPE(plus(q(sK0),perm(sK0)),plus(p(perm(sK0)),perm(sK0)))
| sPE(plus(p(perm(sK1)),perm(sK1)),plus(p(perm(sK0)),perm(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g36,plain,
( ~ sPE(q(sK0),p(perm(sK0)))
| ~ sPE(perm(sK0),perm(sK0))
| sPE(plus(q(sK0),perm(sK0)),plus(p(perm(sK0)),perm(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g37,plain,
( ~ sPE(minus(p(perm(sK1)),q(sK0)),minus(perm(sK0),perm(sK1)))
| sPE(plus(p(perm(sK1)),perm(sK1)),plus(q(sK0),perm(sK0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1)]) ).
cnf(g38,plain,
sPE(minus(sK1,sK0),minus(perm(sK0),perm(sK1))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',permutation_another_one)]) ).
cnf(g39,plain,
( ~ sPE(minus(q(sK0),sK0),minus(p(perm(sK1)),sK1))
| sPE(minus(p(perm(sK1)),sK1),minus(q(sK0),sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g40,plain,
( ~ sPE(minus(p(perm(sK1)),sK1),minus(q(sK0),sK0))
| sPE(minus(p(perm(sK1)),q(sK0)),minus(sK1,sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',minus1)]) ).
cnf(g41,plain,
( ~ sPE(plus(q(sK0),sK0),plus(p(perm(sK1)),sK1))
| sPE(minus(q(sK0),p(perm(sK1))),minus(sK1,sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1)]) ).
cnf(g42,plain,
( ~ sPE(minus(p(perm(sK1)),q(sK0)),minus(sK1,sK0))
| ~ sPE(minus(sK1,sK0),minus(perm(sK0),perm(sK1)))
| sPE(minus(p(perm(sK1)),q(sK0)),minus(perm(sK0),perm(sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g43,plain,
( ~ sPE(minus(q(sK0),p(perm(sK1))),minus(sK1,sK0))
| ~ sPE(minus(sK1,sK0),minus(perm(sK0),perm(sK1)))
| sPE(minus(q(sK0),p(perm(sK1))),minus(perm(sK0),perm(sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ133+2 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n028.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 : 600
% 0.12/0.33 % DateTime : Sun May 29 01:56:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 27.88/3.96 % symbols: 15
% 27.88/3.96 % clauses: 33
% 27.88/3.96 % start clauses: 3
% 27.88/3.96 % iterative deepening steps: 3035
% 27.88/3.96 % maximum path limit: 5
% 27.88/3.96 % literal attempts: 9600752
% 27.88/3.96 % depth failures: 7202581
% 27.88/3.96 % regularity failures: 264675
% 27.88/3.96 % tautology failures: 409619
% 27.88/3.96 % reductions: 408186
% 27.88/3.96 % extensions: 9188482
% 27.88/3.96 % SAT variables: 495430
% 27.88/3.96 % SAT clauses: 674668
% 27.88/3.96 % WalkSAT solutions: 674663
% 27.88/3.96 % CDCL solutions: 2
% 27.88/3.96 % SZS status Theorem for theBenchmark
% 27.88/3.96 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------