TSTP Solution File: GRA008+2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRA008+2 : 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 18.89s 2.78s
% Output : Proof 18.89s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
complete,
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle)]) ).
cnf(g1,plain,
shortest_path(sK9,sK10,sK13),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle)]) ).
cnf(g2,plain,
precedes(sK11,sK12,sK13),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle)]) ).
cnf(g3,plain,
sequential(sK11,sK12),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle)]) ).
cnf(g4,plain,
( ~ shortest_path(sK9,sK10,sK13)
| path(sK9,sK10,sK13) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_defn)]) ).
cnf(g5,plain,
( ~ sequential(sK11,sK12)
| edge(sK11) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g6,plain,
( ~ sequential(sK11,sK12)
| edge(sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g7,plain,
( ~ complete
| ~ precedes(sK11,sK12,sK13)
| ~ shortest_path(sK9,sK10,sK13)
| sPE(head_of(sK8(sK9,sK10,sK11,sK12,sK13)),tail_of(sK11)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g8,plain,
( ~ sPE(head_of(sK8(sK9,sK10,sK11,sK12,sK13)),tail_of(sK11))
| ~ edge(sK8(sK9,sK10,sK11,sK12,sK13))
| ~ edge(sK11)
| sPE(sK8(sK9,sK10,sK11,sK12,sK13),sK11)
| sequential(sK8(sK9,sK10,sK11,sK12,sK13),sK11) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g9,plain,
( ~ complete
| ~ precedes(sK11,sK12,sK13)
| ~ shortest_path(sK9,sK10,sK13)
| edge(sK8(sK9,sK10,sK11,sK12,sK13)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g10,plain,
( ~ sPE(head_of(sK8(sK9,sK10,sK11,sK12,sK13)),tail_of(sK8(sK9,sK10,sK11,sK12,sK13)))
| ~ edge(sK8(sK9,sK10,sK11,sK12,sK13)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',no_loops)]) ).
cnf(g11,plain,
( ~ complete
| ~ precedes(sK11,sK12,sK13)
| ~ shortest_path(sK9,sK10,sK13)
| sPE(tail_of(sK8(sK9,sK10,sK11,sK12,sK13)),head_of(sK12)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge)]) ).
cnf(g12,plain,
( ~ sPE(tail_of(sK8(sK9,sK10,sK11,sK12,sK13)),head_of(sK12))
| sPE(head_of(sK12),tail_of(sK8(sK9,sK10,sK11,sK12,sK13))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
sPE(sK11,sK11),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ edge(sK11)
| ~ edge(sK12)
| ~ edge(sK8(sK9,sK10,sK11,sK12,sK13))
| ~ sequential(sK11,sK12)
| ~ sequential(sK12,sK8(sK9,sK10,sK11,sK12,sK13))
| ~ sequential(sK8(sK9,sK10,sK11,sK12,sK13),sK11)
| triangle(sK11,sK12,sK8(sK9,sK10,sK11,sK12,sK13)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',triangle_defn)]) ).
cnf(g15,plain,
( ~ sPE(head_of(sK12),tail_of(sK8(sK9,sK10,sK11,sK12,sK13)))
| ~ edge(sK12)
| ~ edge(sK8(sK9,sK10,sK11,sK12,sK13))
| sPE(sK12,sK8(sK9,sK10,sK11,sK12,sK13))
| sequential(sK12,sK8(sK9,sK10,sK11,sK12,sK13)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g16,plain,
( ~ path(sK9,sK10,sK13)
| ~ precedes(sK11,sK12,sK13)
| on_path(sK12,sK13) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_properties)]) ).
cnf(g17,plain,
( ~ precedes(sK12,sK12,sK13)
| ~ precedes(sK12,sK12,sK13)
| ~ shortest_path(sK9,sK10,sK13) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_properties)]) ).
cnf(g18,plain,
( ~ sPE(head_of(sK8(sK9,sK10,sK11,sK12,sK13)),tail_of(sK11))
| ~ sPE(tail_of(sK11),tail_of(sK8(sK9,sK10,sK11,sK12,sK13)))
| sPE(head_of(sK8(sK9,sK10,sK11,sK12,sK13)),tail_of(sK8(sK9,sK10,sK11,sK12,sK13))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ path(sK9,sK10,sK13)
| ~ on_path(sK12,sK13)
| ~ on_path(sK12,sK13)
| ~ sequential(sK12,sK11)
| ~ precedes(sK11,sK12,sK13)
| precedes(sK12,sK12,sK13) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_defn)]) ).
cnf(g20,plain,
( ~ sPE(sK8(sK9,sK10,sK11,sK12,sK13),sK11)
| sPE(tail_of(sK8(sK9,sK10,sK11,sK12,sK13)),tail_of(sK11)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(tail_of(sK8(sK9,sK10,sK11,sK12,sK13)),tail_of(sK11))
| sPE(tail_of(sK11),tail_of(sK8(sK9,sK10,sK11,sK12,sK13))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
~ triangle(sK11,sK12,sK8(sK9,sK10,sK11,sK12,sK13)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle)]) ).
cnf(g23,plain,
( ~ sPE(sK12,sK8(sK9,sK10,sK11,sK12,sK13))
| sPE(sK8(sK9,sK10,sK11,sK12,sK13),sK12) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(sK8(sK9,sK10,sK11,sK12,sK13),sK12)
| ~ sPE(sK11,sK11)
| ~ sequential(sK8(sK9,sK10,sK11,sK12,sK13),sK11)
| sequential(sK12,sK11) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRA008+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n018.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 00:57:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 18.89/2.78 % symbols: 41
% 18.89/2.78 % clauses: 97
% 18.89/2.78 % start clauses: 5
% 18.89/2.78 % iterative deepening steps: 910
% 18.89/2.78 % maximum path limit: 4
% 18.89/2.78 % literal attempts: 7667886
% 18.89/2.78 % depth failures: 7236912
% 18.89/2.78 % regularity failures: 28160
% 18.89/2.78 % tautology failures: 75337
% 18.89/2.78 % reductions: 57931
% 18.89/2.78 % extensions: 7608507
% 18.89/2.78 % SAT variables: 237473
% 18.89/2.78 % SAT clauses: 239022
% 18.89/2.78 % WalkSAT solutions: 239015
% 18.89/2.78 % CDCL solutions: 6
% 18.89/2.78 % SZS status Theorem for theBenchmark
% 18.89/2.78 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------