TSTP Solution File: SYN944+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n028.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:55:46 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
s(sK1),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g1,plain,
r(sK1,sK2),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g2,plain,
( ~ s(sK1)
| p(sK1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g3,plain,
( ~ r(sK1,sK2)
| q(sK1,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
cnf(g4,plain,
( ~ p(sK1)
| ~ q(sK1,sK2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 08:53:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % symbols: 9
% 0.12/0.34 % clauses: 6
% 0.12/0.34 % start clauses: 3
% 0.12/0.34 % iterative deepening steps: 21
% 0.12/0.34 % maximum path limit: 1
% 0.12/0.34 % literal attempts: 140
% 0.12/0.34 % depth failures: 56
% 0.12/0.34 % regularity failures: 0
% 0.12/0.34 % tautology failures: 0
% 0.12/0.34 % reductions: 0
% 0.12/0.34 % extensions: 81
% 0.12/0.34 % SAT variables: 56
% 0.12/0.34 % SAT clauses: 63
% 0.12/0.34 % WalkSAT solutions: 56
% 0.12/0.34 % CDCL solutions: 0
% 0.12/0.34 % SZS status Theorem for theBenchmark
% 0.12/0.34 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------