TSTP Solution File: GRA010+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n024.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 : Sat Jul 16 07:21:46 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
path(sK9,sK10,sK8),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles)]) ).
cnf(g1,plain,
~ sPE(number_of_in(sequential_pairs,sK8),number_of_in(triangles,sK8)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles)]) ).
cnf(g2,plain,
( ~ path(sK9,sK10,sK8)
| sPE(number_of_in(sequential_pairs,sK8),number_of_in(triangles,sK8))
| on_path(sK6(sK8,sK9,sK10),sK8) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
cnf(g3,plain,
( ~ path(sK9,sK10,sK8)
| sPE(number_of_in(sequential_pairs,sK8),number_of_in(triangles,sK8))
| sequential(sK6(sK8,sK9,sK10),sK7(sK8,sK9,sK10)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
cnf(g4,plain,
( ~ path(sK9,sK10,sK8)
| sPE(number_of_in(sequential_pairs,sK8),number_of_in(triangles,sK8))
| on_path(sK7(sK8,sK9,sK10),sK8) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
cnf(g5,plain,
( ~ on_path(sK6(sK8,sK9,sK10),sK8)
| ~ on_path(sK7(sK8,sK9,sK10),sK8)
| ~ sequential(sK6(sK8,sK9,sK10),sK7(sK8,sK9,sK10))
| triangle(sK6(sK8,sK9,sK10),sK7(sK8,sK9,sK10),sK11(sK6(sK8,sK9,sK10),sK7(sK8,sK9,sK10))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles)]) ).
cnf(g6,plain,
( ~ path(sK9,sK10,sK8)
| ~ triangle(sK6(sK8,sK9,sK10),sK7(sK8,sK9,sK10),sK11(sK6(sK8,sK9,sK10),sK7(sK8,sK9,sK10)))
| sPE(number_of_in(sequential_pairs,sK8),number_of_in(triangles,sK8)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n024.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 : Mon May 30 23:07:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % symbols: 39
% 0.13/0.35 % clauses: 93
% 0.13/0.35 % start clauses: 4
% 0.13/0.35 % iterative deepening steps: 42
% 0.13/0.35 % maximum path limit: 2
% 0.13/0.35 % literal attempts: 3451
% 0.13/0.35 % depth failures: 2936
% 0.13/0.35 % regularity failures: 5
% 0.13/0.35 % tautology failures: 41
% 0.13/0.35 % reductions: 183
% 0.13/0.35 % extensions: 3146
% 0.13/0.35 % SAT variables: 2340
% 0.13/0.35 % SAT clauses: 1918
% 0.13/0.35 % WalkSAT solutions: 1913
% 0.13/0.35 % CDCL solutions: 0
% 0.13/0.35 % SZS status Theorem for theBenchmark
% 0.13/0.35 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------