TSTP Solution File: GRA010+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRA010+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n016.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 : Tue Aug 22 10:39:25 EDT 2023
% Result : Theorem 5.49s 2.41s
% Output : CNFRefutation 6.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 37
% Syntax : Number of formulae : 51 ( 4 unt; 35 typ; 0 def)
% Number of atoms : 49 ( 11 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 56 ( 23 ~; 22 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 59 ( 25 >; 34 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 2 prp; 0-3 aty)
% Number of functors : 24 ( 24 usr; 9 con; 0-5 aty)
% Number of variables : 41 (; 39 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ triangle > shortest_path > precedes > path > sequential > on_path > less_or_equal > in_path > vertex > edge > path_cons > number_of_in > minus > #nlpp > tail_of > length_of > head_of > triangles > sequential_pairs > n1 > graph > empty > edges > complete > #skF_11 > #skF_6 > #skF_5 > #skF_10 > #skF_12 > #skF_2 > #skF_9 > #skF_7 > #skF_4 > #skF_3 > #skF_8 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(head_of,type,
head_of: $i > $i ).
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(triangle,type,
triangle: ( $i * $i * $i ) > $o ).
tff(triangles,type,
triangles: $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff(number_of_in,type,
number_of_in: ( $i * $i ) > $i ).
tff(on_path,type,
on_path: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(vertex,type,
vertex: $i > $o ).
tff(n1,type,
n1: $i ).
tff(length_of,type,
length_of: $i > $i ).
tff(sequential_pairs,type,
sequential_pairs: $i ).
tff(edge,type,
edge: $i > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(precedes,type,
precedes: ( $i * $i * $i ) > $o ).
tff(graph,type,
graph: $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i * $i ) > $i ).
tff(in_path,type,
in_path: ( $i * $i ) > $o ).
tff(sequential,type,
sequential: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(tail_of,type,
tail_of: $i > $i ).
tff(edges,type,
edges: $i ).
tff(complete,type,
complete: $o ).
tff(path_cons,type,
path_cons: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i ).
tff(shortest_path,type,
shortest_path: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(path,type,
path: ( $i * $i * $i ) > $o ).
tff(minus,type,
minus: ( $i * $i ) > $i ).
tff(f_273,negated_conjecture,
~ ( complete
=> ! [P,V1,V2] :
( ( path(V1,V2,P)
& ! [E1,E2] :
( ( on_path(E1,P)
& on_path(E2,P)
& sequential(E1,E2) )
=> ? [E3] : triangle(E1,E2,E3) ) )
=> ( number_of_in(sequential_pairs,P) = number_of_in(triangles,P) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
tff(f_254,axiom,
! [P,V1,V2] :
( ( path(V1,V2,P)
& ! [E1,E2] :
( ( on_path(E1,P)
& on_path(E2,P)
& sequential(E1,E2) )
=> ? [E3] : triangle(E1,E2,E3) ) )
=> ( number_of_in(sequential_pairs,P) = number_of_in(triangles,P) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
tff(c_142,plain,
number_of_in(triangles,'#skF_9') != number_of_in(sequential_pairs,'#skF_9'),
inference(cnfTransformation,[status(thm)],[f_273]) ).
tff(c_136,plain,
! [P_84,V1_85,V2_86] :
( on_path('#skF_8'(P_84,V1_85,V2_86),P_84)
| ( number_of_in(triangles,P_84) = number_of_in(sequential_pairs,P_84) )
| ~ path(V1_85,V2_86,P_84) ),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_138,plain,
! [P_84,V1_85,V2_86] :
( on_path('#skF_7'(P_84,V1_85,V2_86),P_84)
| ( number_of_in(triangles,P_84) = number_of_in(sequential_pairs,P_84) )
| ~ path(V1_85,V2_86,P_84) ),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_134,plain,
! [P_84,V1_85,V2_86] :
( sequential('#skF_7'(P_84,V1_85,V2_86),'#skF_8'(P_84,V1_85,V2_86))
| ( number_of_in(triangles,P_84) = number_of_in(sequential_pairs,P_84) )
| ~ path(V1_85,V2_86,P_84) ),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_144,plain,
! [E1_99,E2_100] :
( triangle(E1_99,E2_100,'#skF_12'(E1_99,E2_100))
| ~ sequential(E1_99,E2_100)
| ~ on_path(E2_100,'#skF_9')
| ~ on_path(E1_99,'#skF_9') ),
inference(cnfTransformation,[status(thm)],[f_273]) ).
tff(c_1032,plain,
! [P_336,V1_337,V2_338,E3_339] :
( ~ triangle('#skF_7'(P_336,V1_337,V2_338),'#skF_8'(P_336,V1_337,V2_338),E3_339)
| ( number_of_in(triangles,P_336) = number_of_in(sequential_pairs,P_336) )
| ~ path(V1_337,V2_338,P_336) ),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_1046,plain,
! [P_346,V1_347,V2_348] :
( ( number_of_in(triangles,P_346) = number_of_in(sequential_pairs,P_346) )
| ~ path(V1_347,V2_348,P_346)
| ~ sequential('#skF_7'(P_346,V1_347,V2_348),'#skF_8'(P_346,V1_347,V2_348))
| ~ on_path('#skF_8'(P_346,V1_347,V2_348),'#skF_9')
| ~ on_path('#skF_7'(P_346,V1_347,V2_348),'#skF_9') ),
inference(resolution,[status(thm)],[c_144,c_1032]) ).
tff(c_1519,plain,
! [P_453,V1_454,V2_455] :
( ~ on_path('#skF_8'(P_453,V1_454,V2_455),'#skF_9')
| ~ on_path('#skF_7'(P_453,V1_454,V2_455),'#skF_9')
| ( number_of_in(triangles,P_453) = number_of_in(sequential_pairs,P_453) )
| ~ path(V1_454,V2_455,P_453) ),
inference(resolution,[status(thm)],[c_134,c_1046]) ).
tff(c_1523,plain,
! [V1_85,V2_86] :
( ~ on_path('#skF_8'('#skF_9',V1_85,V2_86),'#skF_9')
| ( number_of_in(triangles,'#skF_9') = number_of_in(sequential_pairs,'#skF_9') )
| ~ path(V1_85,V2_86,'#skF_9') ),
inference(resolution,[status(thm)],[c_138,c_1519]) ).
tff(c_1527,plain,
! [V1_456,V2_457] :
( ~ on_path('#skF_8'('#skF_9',V1_456,V2_457),'#skF_9')
| ~ path(V1_456,V2_457,'#skF_9') ),
inference(negUnitSimplification,[status(thm)],[c_142,c_142,c_1523]) ).
tff(c_1531,plain,
! [V1_85,V2_86] :
( ( number_of_in(triangles,'#skF_9') = number_of_in(sequential_pairs,'#skF_9') )
| ~ path(V1_85,V2_86,'#skF_9') ),
inference(resolution,[status(thm)],[c_136,c_1527]) ).
tff(c_1534,plain,
! [V1_85,V2_86] : ~ path(V1_85,V2_86,'#skF_9'),
inference(negUnitSimplification,[status(thm)],[c_142,c_1531]) ).
tff(c_146,plain,
path('#skF_10','#skF_11','#skF_9'),
inference(cnfTransformation,[status(thm)],[f_273]) ).
tff(c_1543,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1534,c_146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRA010+1 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:36:08 EDT 2023
% 0.13/0.36 % CPUTime :
% 5.49/2.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.49/2.41
% 5.49/2.41 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.13/2.44
% 6.13/2.44 Inference rules
% 6.13/2.44 ----------------------
% 6.13/2.44 #Ref : 2
% 6.13/2.44 #Sup : 359
% 6.13/2.44 #Fact : 4
% 6.13/2.44 #Define : 0
% 6.13/2.44 #Split : 4
% 6.13/2.44 #Chain : 0
% 6.13/2.44 #Close : 0
% 6.13/2.44
% 6.13/2.44 Ordering : KBO
% 6.13/2.44
% 6.13/2.44 Simplification rules
% 6.13/2.44 ----------------------
% 6.13/2.44 #Subsume : 62
% 6.13/2.44 #Demod : 6
% 6.13/2.44 #Tautology : 84
% 6.13/2.44 #SimpNegUnit : 11
% 6.13/2.44 #BackRed : 3
% 6.13/2.44
% 6.13/2.44 #Partial instantiations: 0
% 6.13/2.44 #Strategies tried : 1
% 6.13/2.44
% 6.13/2.44 Timing (in seconds)
% 6.13/2.44 ----------------------
% 6.13/2.44 Preprocessing : 0.64
% 6.13/2.44 Parsing : 0.29
% 6.13/2.44 CNF conversion : 0.05
% 6.13/2.44 Main loop : 0.73
% 6.13/2.44 Inferencing : 0.30
% 6.13/2.44 Reduction : 0.17
% 6.13/2.44 Demodulation : 0.11
% 6.13/2.44 BG Simplification : 0.05
% 6.13/2.44 Subsumption : 0.17
% 6.13/2.44 Abstraction : 0.04
% 6.13/2.44 MUC search : 0.00
% 6.13/2.44 Cooper : 0.00
% 6.13/2.44 Total : 1.42
% 6.13/2.44 Index Insertion : 0.00
% 6.13/2.44 Index Deletion : 0.00
% 6.13/2.44 Index Matching : 0.00
% 6.13/2.44 BG Taut test : 0.00
%------------------------------------------------------------------------------