TSTP Solution File: GRA004+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n032.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 2.52s 0.67s
% Output : Proof 2.52s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
shortest_path(sK8,sK9,sK12),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma)]) ).
cnf(g1,plain,
precedes(sK10,sK11,sK12),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma)]) ).
cnf(g2,plain,
( sPE(head_of(sK11),head_of(sK10))
| sPE(head_of(sK11),tail_of(sK10))
| sPE(tail_of(sK13),tail_of(sK10)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma)]) ).
cnf(g3,plain,
( sPE(head_of(sK11),head_of(sK10))
| sPE(head_of(sK11),tail_of(sK10))
| sPE(head_of(sK13),head_of(sK11)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties_lemma)]) ).
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,
( ~ 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(g6,plain,
( ~ sPE(head_of(sK11),head_of(sK10))
| sPE(head_of(sK10),head_of(sK11)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ path(sK8,sK9,sK12)
| ~ on_path(sK11,sK12)
| edge(sK11) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',on_path_properties)]) ).
cnf(g8,plain,
( ~ sPE(head_of(sK13),head_of(sK11))
| ~ sPE(tail_of(sK13),tail_of(sK10))
| ~ precedes(sK10,sK11,sK12)
| ~ shortest_path(sK8,sK9,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',shortest_path_properties)]) ).
cnf(g9,plain,
sPE(tail_of(sK10),tail_of(sK10)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(head_of(sK10),head_of(sK11))
| ~ sPE(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)]) ).
cnf(g11,plain,
( ~ sPE(sK11,sK10)
| sPE(head_of(sK11),head_of(sK10)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sequential(sK10,sK11)
| edge(sK10) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g13,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(g14,plain,
( ~ path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| sequential(sK10,sK11)
| sequential(sK10,sK4(sK12,sK8,sK9,sK10,sK11)) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_properties)]) ).
cnf(g15,plain,
( ~ sequential(sK10,sK4(sK12,sK8,sK9,sK10,sK11))
| edge(sK10) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',sequential_defn)]) ).
cnf(g16,plain,
( ~ path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| on_path(sK11,sK12) ),
inference(ground_cnf,[],[file('Axioms/GRA001+0.ax',precedes_properties)]) ).
cnf(g17,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)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.00/0.09 % Command : satcop --statistics %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.28 % DateTime : Tue May 31 03:36:43 EDT 2022
% 0.10/0.28 % CPUTime :
% 2.52/0.67 % symbols: 41
% 2.52/0.67 % clauses: 92
% 2.52/0.67 % start clauses: 4
% 2.52/0.67 % iterative deepening steps: 270
% 2.52/0.67 % maximum path limit: 3
% 2.52/0.67 % literal attempts: 1041461
% 2.52/0.67 % depth failures: 982443
% 2.52/0.67 % regularity failures: 1566
% 2.52/0.67 % tautology failures: 2548
% 2.52/0.67 % reductions: 22417
% 2.52/0.67 % extensions: 1018124
% 2.52/0.67 % SAT variables: 127888
% 2.52/0.67 % SAT clauses: 103348
% 2.52/0.67 % WalkSAT solutions: 103344
% 2.52/0.67 % CDCL solutions: 1
% 2.52/0.67 % SZS status Theorem for theBenchmark
% 2.52/0.67 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------