TSTP Solution File: SYN084+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n004.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 21 11:48:45 EDT 2022
% Result : Theorem 0.14s 0.36s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( big_p(a)
| sP1
| sP2 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g1,plain,
( ~ big_p(sK0)
| sP1
| sP2 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g2,plain,
( ~ big_p(f(f(sK0)))
| sP1
| sP2 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g3,plain,
( ~ big_p(f(f(sK0)))
| ~ sP1 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g4,plain,
( ~ big_p(f(f(sK1)))
| ~ sP2 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g5,plain,
( ~ big_p(sK1)
| big_p(f(sK1))
| ~ sP2 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g6,plain,
( big_p(a)
| ~ sP2 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g7,plain,
( big_p(a)
| ~ sP1 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g8,plain,
( big_p(f(sK0))
| ~ sP1 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g9,plain,
( ~ big_p(a)
| big_p(sK0)
| big_p(f(f(sK0)))
| ~ sP0(sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g10,plain,
( ~ big_p(a)
| ~ big_p(f(sK0))
| big_p(f(f(sK0)))
| ~ sP0(sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g11,plain,
( ~ big_p(a)
| big_p(sK0)
| big_p(f(f(sK0)))
| sP0(sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g12,plain,
( ~ big_p(a)
| ~ big_p(f(sK1))
| big_p(f(f(sK1)))
| sP0(sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g13,plain,
( ~ big_p(a)
| ~ big_p(f(sK1))
| big_p(f(f(sK1)))
| ~ sP0(sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g14,plain,
( ~ big_p(a)
| big_p(sK1)
| big_p(f(f(sK1)))
| ~ sP0(sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g15,plain,
( ~ big_p(a)
| ~ big_p(f(sK0))
| big_p(f(f(sK0)))
| sP0(sK0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
cnf(g16,plain,
( ~ big_p(a)
| big_p(sK1)
| big_p(f(f(sK1)))
| sP0(sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14 % Command : satcop --statistics %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 12:49:07 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % symbols: 10
% 0.14/0.36 % clauses: 13
% 0.14/0.36 % start clauses: 5
% 0.14/0.36 % iterative deepening steps: 49
% 0.14/0.36 % maximum path limit: 2
% 0.14/0.36 % literal attempts: 2827
% 0.14/0.36 % depth failures: 1782
% 0.14/0.36 % regularity failures: 0
% 0.14/0.36 % tautology failures: 99
% 0.14/0.36 % reductions: 113
% 0.14/0.36 % extensions: 2509
% 0.14/0.36 % SAT variables: 227
% 0.14/0.36 % SAT clauses: 538
% 0.14/0.36 % WalkSAT solutions: 530
% 0.14/0.36 % CDCL solutions: 0
% 0.14/0.36 % SZS status Theorem for theBenchmark
% 0.14/0.36 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------