%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRA002+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n029.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:45 EDT 2022
% Result : Theorem 29.89s 4.20s
% Output : Proof 29.89s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
complete,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length)]) ).
cnf(g1,plain,
shortest_path(sK10,sK11,sK9),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length)]) ).
cnf(g2,plain,
~ less_or_equal(minus(length_of(sK9),n1),number_of_in(triangles,graph)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length)]) ).
cnf(g3,plain,
( ~ shortest_path(sK10,sK11,sK9)
| path(sK10,sK11,sK9) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_defn)]) ).
cnf(g4,plain,
( ~ path(sK10,sK11,sK9)
| sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
| sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
cnf(g5,plain,
( ~ path(sK10,sK11,sK9)
| sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
| on_path(sK6(sK9,sK10,sK11),sK9) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
cnf(g6,plain,
( ~ path(sK10,sK11,sK9)
| sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
| on_path(sK7(sK9,sK10,sK11),sK9) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
cnf(g7,plain,
( ~ path(sK10,sK11,sK9)
| sPE(number_of_in(sequential_pairs,sK9),minus(length_of(sK9),n1)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_length_sequential_pairs)]) ).
cnf(g8,plain,
less_or_equal(number_of_in(triangles,sK9),number_of_in(triangles,graph)),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_has_them_all)]) ).
cnf(g9,plain,
sPE(number_of_in(triangles,graph),number_of_in(triangles,graph)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9))
| sPE(number_of_in(triangles,sK9),number_of_in(sequential_pairs,sK9)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ path(sK10,sK11,sK9)
| ~ on_path(sK6(sK9,sK10,sK11),sK9)
| ~ on_path(sK7(sK9,sK10,sK11),sK9)
| ~ sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11))
| precedes(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_defn)]) ).
cnf(g12,plain,
( ~ complete
| ~ precedes(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)
| ~ shortest_path(sK10,sK11,sK9)
| edge(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g13,plain,
( ~ complete
| ~ precedes(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)
| ~ shortest_path(sK10,sK11,sK9)
| sPE(tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),head_of(sK7(sK9,sK10,sK11))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g14,plain,
( ~ complete
| ~ precedes(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)
| ~ shortest_path(sK10,sK11,sK9)
| sPE(head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK6(sK9,sK10,sK11))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g15,plain,
( ~ sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11))
| edge(sK6(sK9,sK10,sK11)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g16,plain,
( ~ sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11))
| edge(sK7(sK9,sK10,sK11)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g17,plain,
( ~ sPE(number_of_in(sequential_pairs,sK9),minus(length_of(sK9),n1))
| ~ sPE(number_of_in(triangles,graph),number_of_in(triangles,graph))
| ~ less_or_equal(number_of_in(sequential_pairs,sK9),number_of_in(triangles,graph))
| less_or_equal(minus(length_of(sK9),n1),number_of_in(triangles,graph)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(number_of_in(triangles,sK9),number_of_in(sequential_pairs,sK9))
| ~ sPE(number_of_in(triangles,graph),number_of_in(triangles,graph))
| ~ less_or_equal(number_of_in(triangles,sK9),number_of_in(triangles,graph))
| less_or_equal(number_of_in(sequential_pairs,sK9),number_of_in(triangles,graph)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),head_of(sK7(sK9,sK10,sK11)))
| sPE(head_of(sK7(sK9,sK10,sK11)),tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)))
| sPE(head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)))
| ~ edge(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',no_loops)]) ).
cnf(g22,plain,
( ~ sPE(head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK6(sK9,sK10,sK11)))
| ~ edge(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
| ~ edge(sK6(sK9,sK10,sK11))
| sPE(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9),sK6(sK9,sK10,sK11))
| sequential(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9),sK6(sK9,sK10,sK11)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g23,plain,
( ~ sPE(head_of(sK7(sK9,sK10,sK11)),tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)))
| ~ edge(sK7(sK9,sK10,sK11))
| ~ edge(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
| sPE(sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
| sequential(sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g24,plain,
( ~ sPE(sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
| sPE(head_of(sK7(sK9,sK10,sK11)),head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK6(sK9,sK10,sK11)))
| ~ sPE(tail_of(sK6(sK9,sK10,sK11)),tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)))
| sPE(head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK6(sK9,sK10,sK11)))
| sPE(tail_of(sK6(sK9,sK10,sK11)),tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),head_of(sK7(sK9,sK10,sK11)))
| ~ sPE(head_of(sK7(sK9,sK10,sK11)),head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)))
| sPE(tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),head_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ edge(sK6(sK9,sK10,sK11))
| ~ edge(sK7(sK9,sK10,sK11))
| ~ edge(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
| ~ sequential(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11))
| ~ sequential(sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
| ~ sequential(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9),sK6(sK9,sK10,sK11))
| triangle(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',triangle_defn)]) ).
cnf(g29,plain,
( ~ path(sK10,sK11,sK9)
| ~ triangle(sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9))
| sPE(number_of_in(sequential_pairs,sK9),number_of_in(triangles,sK9)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles)]) ).
cnf(g30,plain,
( ~ sPE(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9),sK6(sK9,sK10,sK11))
| sPE(tail_of(sK8(sK10,sK11,sK6(sK9,sK10,sK11),sK7(sK9,sK10,sK11),sK9)),tail_of(sK6(sK9,sK10,sK11))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRA002+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n029.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 : Tue May 31 01:35:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 29.89/4.20 % symbols: 39
% 29.89/4.20 % clauses: 95
% 29.89/4.20 % start clauses: 3
% 29.89/4.20 % iterative deepening steps: 1050
% 29.89/4.20 % maximum path limit: 4
% 29.89/4.20 % literal attempts: 3423831
% 29.89/4.20 % depth failures: 2966933
% 29.89/4.20 % regularity failures: 34835
% 29.89/4.20 % tautology failures: 45576
% 29.89/4.20 % reductions: 70839
% 29.89/4.20 % extensions: 3351184
% 29.89/4.20 % SAT variables: 1449998
% 29.89/4.20 % SAT clauses: 1190962
% 29.89/4.20 % WalkSAT solutions: 1190954
% 29.89/4.20 % CDCL solutions: 6
% 29.89/4.20 % SZS status Theorem for theBenchmark
% 29.89/4.20 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------