TSTP Solution File: GRA007+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRA007+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n018.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 16.83s 2.61s
% Output : Proof 16.83s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
complete,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g1,plain,
shortest_path(sK8,sK9,sK12),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g2,plain,
precedes(sK10,sK11,sK12),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g3,plain,
( ~ precedes(sK11,sK11,sK12)
| ~ precedes(sK11,sK11,sK12)
| ~ shortest_path(sK8,sK9,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_properties)]) ).
cnf(g4,plain,
( ~ shortest_path(sK8,sK9,sK12)
| path(sK8,sK9,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_defn)]) ).
cnf(g5,plain,
( ~ vertex(head_of(sK11))
| ~ vertex(tail_of(sK10))
| ~ complete
| sPE(head_of(sK11),tail_of(sK10))
| sPE(tail_of(sK10),tail_of(sK0(head_of(sK11),tail_of(sK10))))
| sP0(head_of(sK11),tail_of(sK10)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',complete_properties)]) ).
cnf(g6,plain,
( ~ vertex(head_of(sK11))
| ~ vertex(tail_of(sK10))
| ~ complete
| sPE(head_of(sK11),tail_of(sK10))
| sPE(head_of(sK11),head_of(sK0(head_of(sK11),tail_of(sK10))))
| sP0(head_of(sK11),tail_of(sK10)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',complete_properties)]) ).
cnf(g7,plain,
( ~ vertex(head_of(sK11))
| ~ vertex(tail_of(sK10))
| ~ complete
| sPE(head_of(sK11),tail_of(sK10))
| edge(sK0(head_of(sK11),tail_of(sK10))) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',complete_properties)]) ).
cnf(g8,plain,
( ~ edge(sK11)
| vertex(head_of(sK11)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',edge_ends_are_vertices)]) ).
cnf(g9,plain,
( ~ path(sK8,sK9,sK12)
| sPE(sK8,tail_of(sK1(sK8,sK9,sK12))) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',path_properties)]) ).
cnf(g10,plain,
sPE(sK9,sK9),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(sK12,sK12),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(sK11,sK11),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(sK10,sK11)
| ~ sPE(sK11,sK11)
| ~ sPE(sK12,sK12)
| ~ precedes(sK10,sK11,sK12)
| precedes(sK11,sK11,sK12) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(sK11,sK10)
| sPE(sK10,sK11) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(head_of(sK11),tail_of(sK10))
| ~ edge(sK11)
| ~ edge(sK10)
| sPE(sK11,sK10)
| sequential(sK11,sK10) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g16,plain,
( ~ edge(sK10)
| vertex(tail_of(sK10)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',edge_ends_are_vertices)]) ).
cnf(g17,plain,
( ~ sPE(head_of(sK0(head_of(sK11),tail_of(sK10))),tail_of(sK10))
| ~ sPE(tail_of(sK0(head_of(sK11),tail_of(sK10))),head_of(sK11))
| ~ edge(sK0(head_of(sK11),tail_of(sK10))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g18,plain,
( sPE(tail_of(sK10),head_of(sK0(head_of(sK11),tail_of(sK10))))
| ~ sP0(head_of(sK11),tail_of(sK10)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',complete_properties)]) ).
cnf(g19,plain,
( ~ sPE(sK8,tail_of(sK1(sK8,sK9,sK12)))
| ~ sPE(sK9,sK9)
| ~ sPE(sK12,sK12)
| ~ path(sK8,sK9,sK12)
| path(tail_of(sK1(sK8,sK9,sK12)),sK9,sK12) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ path(tail_of(sK1(sK8,sK9,sK12)),sK9,sK12)
| ~ on_path(sK11,sK12)
| edge(sK11) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',on_path_properties)]) ).
cnf(g21,plain,
( ~ path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| on_path(sK10,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_properties)]) ).
cnf(g22,plain,
( ~ path(sK8,sK9,sK12)
| ~ on_path(sK10,sK12)
| edge(sK10) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',on_path_properties)]) ).
cnf(g23,plain,
( ~ path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| on_path(sK11,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_properties)]) ).
cnf(g24,plain,
( ~ path(sK8,sK9,sK12)
| ~ on_path(sK11,sK12)
| ~ on_path(sK11,sK12)
| ~ sequential(sK11,sK10)
| ~ precedes(sK10,sK11,sK12)
| precedes(sK11,sK11,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_defn)]) ).
cnf(g25,plain,
( ~ sPE(tail_of(sK10),head_of(sK0(head_of(sK11),tail_of(sK10))))
| sPE(head_of(sK0(head_of(sK11),tail_of(sK10))),tail_of(sK10)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( sPE(head_of(sK11),tail_of(sK0(head_of(sK11),tail_of(sK10))))
| ~ sP0(head_of(sK11),tail_of(sK10)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',complete_properties)]) ).
cnf(g27,plain,
( ~ sPE(head_of(sK11),tail_of(sK0(head_of(sK11),tail_of(sK10))))
| sPE(tail_of(sK0(head_of(sK11),tail_of(sK10))),head_of(sK11)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(head_of(sK11),head_of(sK0(head_of(sK11),tail_of(sK10))))
| sPE(head_of(sK0(head_of(sK11),tail_of(sK10))),head_of(sK11)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ sPE(tail_of(sK10),tail_of(sK0(head_of(sK11),tail_of(sK10))))
| sPE(tail_of(sK0(head_of(sK11),tail_of(sK10))),tail_of(sK10)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g30,plain,
( ~ sPE(head_of(sK0(head_of(sK11),tail_of(sK10))),head_of(sK11))
| ~ sPE(tail_of(sK0(head_of(sK11),tail_of(sK10))),tail_of(sK10))
| ~ precedes(sK10,sK11,sK12)
| ~ shortest_path(sK8,sK9,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_properties)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRA007+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 23:02:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 16.83/2.61 % symbols: 40
% 16.83/2.61 % clauses: 92
% 16.83/2.61 % start clauses: 4
% 16.83/2.61 % iterative deepening steps: 1179
% 16.83/2.61 % maximum path limit: 4
% 16.83/2.61 % literal attempts: 6349366
% 16.83/2.61 % depth failures: 5742941
% 16.83/2.61 % regularity failures: 45247
% 16.83/2.61 % tautology failures: 104450
% 16.83/2.61 % reductions: 85225
% 16.83/2.61 % extensions: 6261215
% 16.83/2.61 % SAT variables: 305993
% 16.83/2.61 % SAT clauses: 302280
% 16.83/2.61 % WalkSAT solutions: 302271
% 16.83/2.61 % CDCL solutions: 8
% 16.83/2.61 % SZS status Theorem for theBenchmark
% 16.83/2.61 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------