TSTP Solution File: ALG073+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : ALG073+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.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:30 EDT 2022
% Result : Theorem 106.75s 13.88s
% Output : Proof 107.47s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( ~ sorti1(sK1)
| sorti2(h(sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
sorti1(sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g2,plain,
sorti1(sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g3,plain,
( ~ sorti1(sK0)
| sPE(j(h(sK0)),sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
( ~ sorti1(sK1)
| ~ sorti1(sK1)
| sPE(h(op1(sK1,sK1)),op2(h(sK1),h(sK1))) ),
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,
( ~ sorti1(sK0)
| ~ sorti1(sK1)
| sPE(h(op1(sK0,sK1)),op2(h(sK0),h(sK1))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g7,plain,
( ~ sorti1(sK0)
| sorti2(h(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g8,plain,
( ~ sorti1(sK0)
| ~ sorti1(sK0)
| sPE(h(op1(sK0,sK0)),op2(h(sK0),h(sK0))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g9,plain,
( ~ sPE(h(op1(sK0,sK0)),op2(h(sK0),h(sK0)))
| sPE(op2(h(sK0),h(sK0)),h(op1(sK0,sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(h(op1(sK1,sK1)),op2(h(sK1),h(sK1)))
| sPE(op2(h(sK1),h(sK1)),h(op1(sK1,sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(h(j(h(sK0))),h(sK0))
| sPE(h(sK0),h(j(h(sK0)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(h(j(h(sK0))),h(sK0))
| sPE(j(h(j(h(sK0)))),j(h(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
sPE(op1(sK1,sK1),sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g14,plain,
sPE(op1(sK0,sK0),sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g15,plain,
( ~ sorti1(sK0)
| ~ sorti1(sK1)
| sorti1(op1(sK0,sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1)]) ).
cnf(g16,plain,
( ~ sorti1(op1(sK0,sK1))
| sPE(j(h(op1(sK0,sK1))),op1(sK0,sK1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g17,plain,
( ~ sPE(j(h(op1(sK0,sK1))),op1(sK0,sK1))
| sPE(op1(sK0,sK1),j(h(op1(sK0,sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(op2(h(sK0),h(sK0)),h(sK1))
| ~ sPE(op2(h(sK1),h(sK1)),h(sK0))
| ~ sorti2(h(sK0))
| ~ sorti2(h(sK1))
| sPE(op2(h(sK0),h(sK1)),h(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4)]) ).
cnf(g19,plain,
( ~ sPE(op1(sK1,sK1),sK0)
| sPE(h(op1(sK1,sK1)),h(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(op1(sK0,sK1),j(h(sK0)))
| ~ sPE(j(h(sK0)),sK0)
| sPE(op1(sK0,sK1),sK0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
~ sPE(op1(sK0,sK1),sK0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3)]) ).
cnf(g22,plain,
( ~ sPE(op1(sK0,sK0),sK1)
| sPE(h(op1(sK0,sK0)),h(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(j(h(op1(sK0,sK1))),j(h(j(h(sK0)))))
| ~ sPE(j(h(j(h(sK0)))),j(h(sK0)))
| sPE(j(h(op1(sK0,sK1))),j(h(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(op1(sK0,sK1),j(h(op1(sK0,sK1))))
| ~ sPE(j(h(op1(sK0,sK1))),j(h(sK0)))
| sPE(op1(sK0,sK1),j(h(sK0))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(h(op1(sK0,sK1)),h(j(h(sK0))))
| sPE(j(h(op1(sK0,sK1))),j(h(j(h(sK0))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(h(op1(sK0,sK1)),op2(h(sK0),h(sK1)))
| ~ sPE(op2(h(sK0),h(sK1)),h(j(h(sK0))))
| sPE(h(op1(sK0,sK1)),h(j(h(sK0)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(op2(h(sK0),h(sK0)),h(op1(sK0,sK0)))
| ~ sPE(h(op1(sK0,sK0)),h(sK1))
| sPE(op2(h(sK0),h(sK0)),h(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(op2(h(sK1),h(sK1)),h(op1(sK1,sK1)))
| ~ sPE(h(op1(sK1,sK1)),h(sK0))
| sPE(op2(h(sK1),h(sK1)),h(sK0)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ sPE(op2(h(sK0),h(sK1)),h(sK0))
| ~ sPE(h(sK0),h(j(h(sK0))))
| sPE(op2(h(sK0),h(sK1)),h(j(h(sK0)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ALG073+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n017.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 : Wed Jun 8 05:28:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 106.75/13.88 % symbols: 10
% 106.75/13.88 % clauses: 23
% 106.75/13.88 % start clauses: 6
% 106.75/13.88 % iterative deepening steps: 6475
% 106.75/13.88 % maximum path limit: 4
% 106.75/13.88 % literal attempts: 13566455
% 106.75/13.88 % depth failures: 10308671
% 106.75/13.88 % regularity failures: 224070
% 106.75/13.88 % tautology failures: 650076
% 106.75/13.88 % reductions: 1069105
% 106.75/13.88 % extensions: 12485263
% 106.75/13.88 % SAT variables: 3859765
% 106.75/13.88 % SAT clauses: 4155896
% 106.75/13.88 % WalkSAT solutions: 4155847
% 106.75/13.88 % CDCL solutions: 45
% 106.75/13.88 % SZS status Theorem for theBenchmark
% 106.75/13.88 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------