TSTP Solution File: ALG041+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : ALG041+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n018.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 : Thu Jul 14 17:58:24 EDT 2022
% Result : Theorem 40.21s 5.46s
% Output : Proof 40.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( ~ sorti2(sK1)
| sorti1(j(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
sorti2(sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4)]) ).
cnf(g2,plain,
( ~ sPE(op1(sK0(j(sK1)),sK0(j(sK1))),j(sK1))
| ~ sorti1(j(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g3,plain,
( ~ sorti1(j(sK1))
| sorti1(sK0(j(sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g4,plain,
( ~ sorti1(sK0(j(sK1)))
| sorti2(h(sK0(j(sK1)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
( ~ sPE(j(sK1),op1(sK0(j(sK1)),sK0(j(sK1))))
| sPE(op1(sK0(j(sK1)),sK0(j(sK1))),j(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sorti2(h(sK0(j(sK1))))
| sPE(op2(h(sK0(j(sK1))),h(sK0(j(sK1)))),sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4)]) ).
cnf(g7,plain,
( ~ sorti1(sK0(j(sK1)))
| ~ sorti1(sK0(j(sK1)))
| sorti1(op1(sK0(j(sK1)),sK0(j(sK1)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1)]) ).
cnf(g8,plain,
( ~ sorti1(sK0(j(sK1)))
| ~ sorti1(sK0(j(sK1)))
| sPE(h(op1(sK0(j(sK1)),sK0(j(sK1)))),op2(h(sK0(j(sK1))),h(sK0(j(sK1))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g9,plain,
( ~ sorti1(op1(sK0(j(sK1)),sK0(j(sK1))))
| sPE(j(h(op1(sK0(j(sK1)),sK0(j(sK1))))),op1(sK0(j(sK1)),sK0(j(sK1)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g10,plain,
( ~ sPE(h(op1(sK0(j(sK1)),sK0(j(sK1)))),op2(h(sK0(j(sK1))),h(sK0(j(sK1)))))
| ~ sPE(op2(h(sK0(j(sK1))),h(sK0(j(sK1)))),sK1)
| sPE(h(op1(sK0(j(sK1)),sK0(j(sK1)))),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(h(op1(sK0(j(sK1)),sK0(j(sK1)))),sK1)
| sPE(sK1,h(op1(sK0(j(sK1)),sK0(j(sK1))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(sK1,h(op1(sK0(j(sK1)),sK0(j(sK1)))))
| sPE(j(sK1),j(h(op1(sK0(j(sK1)),sK0(j(sK1)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(j(sK1),j(h(op1(sK0(j(sK1)),sK0(j(sK1))))))
| ~ sPE(j(h(op1(sK0(j(sK1)),sK0(j(sK1))))),op1(sK0(j(sK1)),sK0(j(sK1))))
| sPE(j(sK1),op1(sK0(j(sK1)),sK0(j(sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG041+1 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n018.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 : Wed Jun 8 20:11:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 40.21/5.46 % symbols: 10
% 40.21/5.46 % clauses: 22
% 40.21/5.46 % start clauses: 6
% 40.21/5.46 % iterative deepening steps: 3450
% 40.21/5.46 % maximum path limit: 4
% 40.21/5.46 % literal attempts: 7905212
% 40.21/5.46 % depth failures: 6243133
% 40.21/5.46 % regularity failures: 104897
% 40.21/5.46 % tautology failures: 273692
% 40.21/5.46 % reductions: 549622
% 40.21/5.46 % extensions: 7349364
% 40.21/5.46 % SAT variables: 1312749
% 40.21/5.46 % SAT clauses: 1416466
% 40.21/5.46 % WalkSAT solutions: 1416445
% 40.21/5.46 % CDCL solutions: 18
% 40.21/5.46 % SZS status Theorem for theBenchmark
% 40.21/5.46 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------