TSTP Solution File: NUN068+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n026.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 16:38:02 EDT 2022
% Result : Theorem 4.15s 0.94s
% Output : Proof 4.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
r2(sK7(sG,sG),sK4(sG,sG)),
inference(ground_cnf,[],[file('Axioms/NUM008+0.ax',axiom_1a)]) ).
cnf(g1,plain,
sPE(sK5(sG,sG),sK4(sG,sG)),
inference(ground_cnf,[],[file('Axioms/NUM008+0.ax',axiom_1a)]) ).
cnf(g2,plain,
r2(sK5(sG,sG),sK6(sG,sK5(sG,sG))),
inference(ground_cnf,[],[file('Axioms/NUM008+0.ax',axiom_1a)]) ).
cnf(g3,plain,
( ~ sPE(sK5(sG,sG),sK4(sG,sG))
| ~ sPE(sK6(sG,sK5(sG,sG)),sK20(sK6(sG,sK5(sG,sG))))
| ~ r2(sK5(sG,sG),sK6(sG,sK5(sG,sG)))
| r2(sK4(sG,sG),sK20(sK6(sG,sK5(sG,sG)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( sPE(sK6(sG,sK5(sG,sG)),sK20(sK6(sG,sK5(sG,sG))))
| sP5(sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosnononesexist)]) ).
cnf(g5,plain,
( r1(sK21(sK6(sG,sK5(sG,sG))))
| sP5(sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosnononesexist)]) ).
cnf(g6,plain,
( r1(sK22(sK6(sG,sK5(sG,sG))))
| ~ sP5(sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosnononesexist)]) ).
cnf(g7,plain,
( ~ sPE(sK22(sK6(sG,sK5(sG,sG))),sK6(sG,sK5(sG,sG)))
| ~ r1(sK22(sK6(sG,sK5(sG,sG))))
| r1(sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(sK6(sG,sK5(sG,sG)),sK6(sG,sK5(sG,sG)))
| ~ r1(sK6(sG,sK5(sG,sG)))
| ~ r2(sK5(sG,sG),sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[file('Axioms/NUM008+0.ax',axiom_7a)]) ).
cnf(g9,plain,
sPE(sK6(sG,sK5(sG,sG)),sK6(sG,sK5(sG,sG))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(sK6(sG,sK5(sG,sG)),sK22(sK6(sG,sK5(sG,sG))))
| sPE(sK22(sK6(sG,sK5(sG,sG))),sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( sPE(sK6(sG,sK5(sG,sG)),sK22(sK6(sG,sK5(sG,sG))))
| ~ sP5(sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosnononesexist)]) ).
cnf(g12,plain,
( ~ sPE(sK21(sK6(sG,sK5(sG,sG))),sK4(sG,sG))
| ~ r1(sK21(sK6(sG,sK5(sG,sG))))
| ~ r2(sK7(sG,sG),sK4(sG,sG)) ),
inference(ground_cnf,[],[file('Axioms/NUM008+0.ax',axiom_7a)]) ).
cnf(g13,plain,
( ~ sPE(sK20(sK6(sG,sK5(sG,sG))),sK20(sK6(sG,sK5(sG,sG))))
| ~ r2(sK21(sK6(sG,sK5(sG,sG))),sK20(sK6(sG,sK5(sG,sG))))
| ~ r2(sK4(sG,sG),sK20(sK6(sG,sK5(sG,sG))))
| sPE(sK21(sK6(sG,sK5(sG,sG))),sK4(sG,sG)) ),
inference(ground_cnf,[],[file('Axioms/NUM008+0.ax',axiom_3a)]) ).
cnf(g14,plain,
( r2(sK21(sK6(sG,sK5(sG,sG))),sK20(sK6(sG,sK5(sG,sG))))
| sP5(sK6(sG,sK5(sG,sG))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosnononesexist)]) ).
cnf(g15,plain,
sPE(sK20(sK6(sG,sK5(sG,sG))),sK20(sK6(sG,sK5(sG,sG)))),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN068+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n026.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 : Thu Jun 2 08:29:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.15/0.94 % symbols: 35
% 4.15/0.94 % clauses: 79
% 4.15/0.94 % start clauses: 3
% 4.15/0.94 % iterative deepening steps: 582
% 4.15/0.94 % maximum path limit: 4
% 4.15/0.94 % literal attempts: 1659348
% 4.15/0.94 % depth failures: 1572169
% 4.15/0.94 % regularity failures: 4316
% 4.15/0.94 % tautology failures: 4192
% 4.15/0.94 % reductions: 5015
% 4.15/0.94 % extensions: 1653554
% 4.15/0.94 % SAT variables: 99081
% 4.15/0.94 % SAT clauses: 102180
% 4.15/0.94 % WalkSAT solutions: 102175
% 4.15/0.94 % CDCL solutions: 3
% 4.15/0.94 % SZS status Theorem for theBenchmark
% 4.15/0.94 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------