TSTP Solution File: ALG178+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : ALG178+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 17:58:46 EDT 2022
% Result : Theorem 34.75s 4.81s
% Output : Proof 34.75s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( ~ sorti2(sK0)
| sorti1(j(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
sorti2(sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)]) ).
cnf(g2,plain,
sorti2(sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)]) ).
cnf(g3,plain,
( ~ sorti2(sK1)
| sPE(h(j(sK1)),sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
( ~ sorti2(sK1)
| sorti1(j(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
( ~ sorti2(sK0)
| ~ sorti2(sK1)
| sPE(j(op2(sK0,sK1)),op1(j(sK0),j(sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
( ~ sorti2(sK0)
| ~ sorti2(sK1)
| sorti2(op2(sK0,sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2)]) ).
cnf(g7,plain,
sPE(j(sK0),j(sK0)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
~ sPE(op2(sK0,op2(sK0,sK1)),sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4)]) ).
cnf(g9,plain,
( ~ sorti2(op2(sK0,op2(sK0,sK1)))
| sPE(h(j(op2(sK0,op2(sK0,sK1)))),op2(sK0,op2(sK0,sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g10,plain,
( ~ sPE(op2(sK0,op2(sK0,sK1)),h(j(sK1)))
| ~ sPE(h(j(sK1)),sK1)
| sPE(op2(sK0,op2(sK0,sK1)),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(h(j(sK1)),op2(sK0,op2(sK0,sK1)))
| sPE(op2(sK0,op2(sK0,sK1)),h(j(sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sorti2(sK0)
| ~ sorti2(op2(sK0,sK1))
| sorti2(op2(sK0,op2(sK0,sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2)]) ).
cnf(g13,plain,
( ~ sorti1(j(sK0))
| ~ sorti1(j(sK1))
| sPE(op1(j(sK0),op1(j(sK0),j(sK1))),j(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3)]) ).
cnf(g14,plain,
( ~ sorti2(sK0)
| ~ sorti2(op2(sK0,sK1))
| sPE(j(op2(sK0,op2(sK0,sK1))),op1(j(sK0),j(op2(sK0,sK1)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g15,plain,
( ~ sPE(j(op2(sK0,op2(sK0,sK1))),op1(j(sK0),j(op2(sK0,sK1))))
| ~ sPE(op1(j(sK0),j(op2(sK0,sK1))),op1(j(sK0),op1(j(sK0),j(sK1))))
| sPE(j(op2(sK0,op2(sK0,sK1))),op1(j(sK0),op1(j(sK0),j(sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(j(sK0),j(sK0))
| ~ sPE(j(op2(sK0,sK1)),op1(j(sK0),j(sK1)))
| sPE(op1(j(sK0),j(op2(sK0,sK1))),op1(j(sK0),op1(j(sK0),j(sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(j(op2(sK0,op2(sK0,sK1))),op1(j(sK0),op1(j(sK0),j(sK1))))
| ~ sPE(op1(j(sK0),op1(j(sK0),j(sK1))),j(sK1))
| sPE(j(op2(sK0,op2(sK0,sK1))),j(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(j(op2(sK0,op2(sK0,sK1))),j(sK1))
| sPE(j(sK1),j(op2(sK0,op2(sK0,sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(h(j(sK1)),h(j(op2(sK0,op2(sK0,sK1)))))
| ~ sPE(h(j(op2(sK0,op2(sK0,sK1)))),op2(sK0,op2(sK0,sK1)))
| sPE(h(j(sK1)),op2(sK0,op2(sK0,sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(j(sK1),j(op2(sK0,op2(sK0,sK1))))
| sPE(h(j(sK1)),h(j(op2(sK0,op2(sK0,sK1))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG178+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n029.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 14:33:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 34.75/4.81 % symbols: 10
% 34.75/4.81 % clauses: 21
% 34.75/4.81 % start clauses: 6
% 34.75/4.81 % iterative deepening steps: 3573
% 34.75/4.81 % maximum path limit: 4
% 34.75/4.81 % literal attempts: 6139703
% 34.75/4.81 % depth failures: 4661905
% 34.75/4.81 % regularity failures: 107736
% 34.75/4.81 % tautology failures: 267615
% 34.75/4.81 % reductions: 508099
% 34.75/4.81 % extensions: 5624929
% 34.75/4.81 % SAT variables: 1462022
% 34.75/4.81 % SAT clauses: 1598449
% 34.75/4.81 % WalkSAT solutions: 1598427
% 34.75/4.81 % CDCL solutions: 19
% 34.75/4.81 % SZS status Theorem for theBenchmark
% 34.75/4.81 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------