TSTP Solution File: GRA003+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GRA003+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n028.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 : 300s
% DateTime : Thu Aug 31 00:00:05 EDT 2023
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 42
% Syntax : Number of formulae : 81 ( 12 unt; 36 typ; 0 def)
% Number of atoms : 212 ( 45 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 259 ( 92 ~; 86 |; 64 &)
% ( 3 <=>; 12 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 51 ( 24 >; 27 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 2 prp; 0-3 aty)
% Number of functors : 25 ( 25 usr; 11 con; 0-4 aty)
% Number of variables : 119 ( 20 sgn; 71 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
edge: $i > $o ).
tff(decl_23,type,
head_of: $i > $i ).
tff(decl_24,type,
tail_of: $i > $i ).
tff(decl_25,type,
vertex: $i > $o ).
tff(decl_26,type,
complete: $o ).
tff(decl_27,type,
path: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
empty: $i ).
tff(decl_29,type,
path_cons: ( $i * $i ) > $i ).
tff(decl_30,type,
on_path: ( $i * $i ) > $o ).
tff(decl_31,type,
in_path: ( $i * $i ) > $o ).
tff(decl_32,type,
sequential: ( $i * $i ) > $o ).
tff(decl_33,type,
precedes: ( $i * $i * $i ) > $o ).
tff(decl_34,type,
shortest_path: ( $i * $i * $i ) > $o ).
tff(decl_35,type,
length_of: $i > $i ).
tff(decl_36,type,
less_or_equal: ( $i * $i ) > $o ).
tff(decl_37,type,
triangle: ( $i * $i * $i ) > $o ).
tff(decl_38,type,
edges: $i ).
tff(decl_39,type,
number_of_in: ( $i * $i ) > $i ).
tff(decl_40,type,
sequential_pairs: $i ).
tff(decl_41,type,
n1: $i ).
tff(decl_42,type,
minus: ( $i * $i ) > $i ).
tff(decl_43,type,
triangles: $i ).
tff(decl_44,type,
graph: $i ).
tff(decl_45,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_46,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_47,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_48,type,
esk4_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_49,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_50,type,
esk6_3: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
esk7_1: $i > $i ).
tff(decl_52,type,
esk8_1: $i > $i ).
tff(decl_53,type,
esk9_0: $i ).
tff(decl_54,type,
esk10_0: $i ).
tff(decl_55,type,
esk11_0: $i ).
tff(decl_56,type,
esk12_0: $i ).
tff(decl_57,type,
esk13_0: $i ).
fof(vertices_and_edges,conjecture,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( vertex(X2)
& vertex(X3)
& X2 != X3
& edge(X7)
& edge(X8)
& X7 != X8
& path(X2,X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',vertices_and_edges) ).
fof(precedes_properties,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
<~> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
fof(path_properties,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
<~> ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',path_properties) ).
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(on_path_properties,axiom,
! [X2,X3,X4,X1] :
( ( path(X2,X3,X4)
& on_path(X1,X4) )
=> ( edge(X1)
& in_path(head_of(X1),X4)
& in_path(tail_of(X1),X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(c_0_6,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( vertex(X2)
& vertex(X3)
& X2 != X3
& edge(X7)
& edge(X8)
& X7 != X8
& path(X2,X3,X4) ) ),
inference(assume_negation,[status(cth)],[vertices_and_edges]) ).
fof(c_0_7,plain,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
=> ( on_path(X7,X4)
& on_path(X8,X4)
& ~ ( sequential(X7,X8)
<=> ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[precedes_properties]) ).
fof(c_0_8,plain,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> ( vertex(X2)
& vertex(X3)
& ? [X1] :
( edge(X1)
& X2 = tail_of(X1)
& ~ ( ( X3 = head_of(X1)
& X4 = path_cons(X1,empty) )
<=> ? [X5] :
( path(head_of(X1),X3,X5)
& X4 = path_cons(X1,X5) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[path_properties]) ).
fof(c_0_9,plain,
! [X53,X54,X55,X56,X57,X58,X59] :
( ( path(X53,X54,X55)
| ~ shortest_path(X53,X54,X55) )
& ( X53 != X54
| ~ shortest_path(X53,X54,X55) )
& ( ~ path(X53,X54,X56)
| less_or_equal(length_of(X55),length_of(X56))
| ~ shortest_path(X53,X54,X55) )
& ( path(X57,X58,esk6_3(X57,X58,X59))
| ~ path(X57,X58,X59)
| X57 = X58
| shortest_path(X57,X58,X59) )
& ( ~ less_or_equal(length_of(X59),length_of(esk6_3(X57,X58,X59)))
| ~ path(X57,X58,X59)
| X57 = X58
| shortest_path(X57,X58,X59) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[shortest_path_defn])])])])])]) ).
fof(c_0_10,negated_conjecture,
( shortest_path(esk9_0,esk10_0,esk13_0)
& precedes(esk11_0,esk12_0,esk13_0)
& ( ~ vertex(esk9_0)
| ~ vertex(esk10_0)
| esk9_0 = esk10_0
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| esk11_0 = esk12_0
| ~ path(esk9_0,esk10_0,esk13_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,plain,
! [X46,X47,X48,X49,X50,X51] :
( ( on_path(X49,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( on_path(X50,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( ~ sequential(X49,X50)
| ~ sequential(X49,X51)
| ~ precedes(X51,X50,X46)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( sequential(X49,esk5_3(X46,X49,X50))
| sequential(X49,X50)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) )
& ( precedes(esk5_3(X46,X49,X50),X50,X46)
| sequential(X49,X50)
| ~ precedes(X49,X50,X46)
| ~ path(X47,X48,X46) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
fof(c_0_12,plain,
! [X23,X24,X25,X27] :
( ( vertex(X23)
| ~ path(X23,X24,X25) )
& ( vertex(X24)
| ~ path(X23,X24,X25) )
& ( edge(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( X23 = tail_of(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( X24 != head_of(esk2_3(X23,X24,X25))
| X25 != path_cons(esk2_3(X23,X24,X25),empty)
| ~ path(head_of(esk2_3(X23,X24,X25)),X24,X27)
| X25 != path_cons(esk2_3(X23,X24,X25),X27)
| ~ path(X23,X24,X25) )
& ( path(head_of(esk2_3(X23,X24,X25)),X24,esk3_3(X23,X24,X25))
| X24 = head_of(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( X25 = path_cons(esk2_3(X23,X24,X25),esk3_3(X23,X24,X25))
| X24 = head_of(esk2_3(X23,X24,X25))
| ~ path(X23,X24,X25) )
& ( path(head_of(esk2_3(X23,X24,X25)),X24,esk3_3(X23,X24,X25))
| X25 = path_cons(esk2_3(X23,X24,X25),empty)
| ~ path(X23,X24,X25) )
& ( X25 = path_cons(esk2_3(X23,X24,X25),esk3_3(X23,X24,X25))
| X25 = path_cons(esk2_3(X23,X24,X25),empty)
| ~ path(X23,X24,X25) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
cnf(c_0_13,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X29,X30,X31,X32] :
( ( edge(X32)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) )
& ( in_path(head_of(X32),X31)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) )
& ( in_path(tail_of(X32),X31)
| ~ path(X29,X30,X31)
| ~ on_path(X32,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])]) ).
cnf(c_0_16,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( vertex(X1)
| ~ path(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( edge(X1)
| ~ path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
( esk9_0 = esk10_0
| esk11_0 = esk12_0
| ~ vertex(esk9_0)
| ~ vertex(esk10_0)
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| ~ path(esk9_0,esk10_0,esk13_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
vertex(esk9_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
vertex(esk10_0),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
fof(c_0_30,plain,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
inference(fof_simplification,[status(thm)],[shortest_path_properties]) ).
cnf(c_0_31,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0
| ~ edge(esk11_0)
| ~ edge(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19])]),c_0_25]),c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
fof(c_0_34,plain,
! [X61,X62,X63,X64,X65,X66] :
( ( tail_of(X66) != tail_of(X63)
| head_of(X66) != head_of(X64)
| ~ shortest_path(X61,X62,X65)
| ~ precedes(X63,X64,X65) )
& ( ~ precedes(X64,X63,X65)
| ~ shortest_path(X61,X62,X65)
| ~ precedes(X63,X64,X65) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).
cnf(c_0_35,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0
| ~ edge(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_37,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
( ~ precedes(X1,X2,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_14]) ).
cnf(c_0_40,negated_conjecture,
( esk10_0 = esk9_0
| precedes(esk12_0,esk12_0,esk13_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_41,plain,
( X1 != X2
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,negated_conjecture,
esk10_0 = esk9_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_40]) ).
cnf(c_0_43,plain,
~ shortest_path(X1,X1,X2),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRA003+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n028.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 : 300
% 0.13/0.34 % DateTime : Sun Aug 27 03:58:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.57 % Version : CSE_E---1.5
% 0.19/0.57 % Problem : theBenchmark.p
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark.p
% 0.19/0.57 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.013000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.017000 s
%------------------------------------------------------------------------------