TSTP Solution File: ALG040+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : ALG040+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n019.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:23 EDT 2022
% Result : Theorem 32.21s 4.49s
% Output : Proof 32.79s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( ~ sorti1(sK0)
| sorti2(h(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
sorti1(sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g2,plain,
( ~ sorti2(h(sK0))
| sorti2(sK1(h(sK0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4)]) ).
cnf(g3,plain,
( ~ sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(sK0))
| ~ sorti2(h(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4)]) ).
cnf(g4,plain,
( ~ sorti1(sK0)
| sPE(j(h(sK0)),sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
( ~ sPE(j(h(sK0)),sK0)
| sPE(h(j(h(sK0))),h(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sorti2(sK1(h(sK0)))
| sorti1(j(sK1(h(sK0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g7,plain,
( ~ sorti2(sK1(h(sK0)))
| ~ sorti2(sK1(h(sK0)))
| sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),op1(j(sK1(h(sK0))),j(sK1(h(sK0))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g8,plain,
( ~ sorti1(j(sK1(h(sK0))))
| sPE(op1(j(sK1(h(sK0))),j(sK1(h(sK0)))),sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g9,plain,
( ~ sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),op1(j(sK1(h(sK0))),j(sK1(h(sK0)))))
| ~ sPE(op1(j(sK1(h(sK0))),j(sK1(h(sK0)))),sK0)
| sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),sK0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(j(op2(sK1(h(sK0)),sK1(h(sK0)))),sK0)
| sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),h(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sorti2(sK1(h(sK0)))
| ~ sorti2(sK1(h(sK0)))
| sorti2(op2(sK1(h(sK0)),sK1(h(sK0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2)]) ).
cnf(g12,plain,
( ~ sorti2(op2(sK1(h(sK0)),sK1(h(sK0))))
| sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),op2(sK1(h(sK0)),sK1(h(sK0)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g13,plain,
( ~ sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(j(h(sK0))))
| ~ sPE(h(j(h(sK0))),h(sK0))
| sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(h(j(h(sK0))),op2(sK1(h(sK0)),sK1(h(sK0))))
| sPE(op2(sK1(h(sK0)),sK1(h(sK0))),h(j(h(sK0)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),h(sK0))
| sPE(h(sK0),h(j(op2(sK1(h(sK0)),sK1(h(sK0)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(h(j(h(sK0))),h(j(op2(sK1(h(sK0)),sK1(h(sK0))))))
| ~ sPE(h(j(op2(sK1(h(sK0)),sK1(h(sK0))))),op2(sK1(h(sK0)),sK1(h(sK0))))
| sPE(h(j(h(sK0))),op2(sK1(h(sK0)),sK1(h(sK0)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(h(j(h(sK0))),h(sK0))
| ~ sPE(h(sK0),h(j(op2(sK1(h(sK0)),sK1(h(sK0))))))
| sPE(h(j(h(sK0))),h(j(op2(sK1(h(sK0)),sK1(h(sK0)))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG040+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n019.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 8 01:45:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 32.21/4.49 % symbols: 10
% 32.21/4.49 % clauses: 22
% 32.21/4.49 % start clauses: 6
% 32.21/4.49 % iterative deepening steps: 3311
% 32.21/4.49 % maximum path limit: 4
% 32.21/4.49 % literal attempts: 7215124
% 32.21/4.49 % depth failures: 5688124
% 32.21/4.49 % regularity failures: 95695
% 32.21/4.49 % tautology failures: 246749
% 32.21/4.49 % reductions: 517371
% 32.21/4.49 % extensions: 6691257
% 32.21/4.49 % SAT variables: 1009420
% 32.21/4.49 % SAT clauses: 1086830
% 32.21/4.49 % WalkSAT solutions: 1086813
% 32.21/4.49 % CDCL solutions: 14
% 32.21/4.49 % SZS status Theorem for theBenchmark
% 32.21/4.49 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------