TSTP Solution File: GRA002+3 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : GRA002+3 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.KiQOCPeUIV true
% 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 : Thu Aug 31 00:10:08 EDT 2023
% Result : Theorem 2.07s 1.01s
% Output : Refutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 28
% Syntax : Number of formulae : 77 ( 27 unt; 21 typ; 0 def)
% Number of atoms : 126 ( 14 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 552 ( 44 ~; 47 |; 10 &; 438 @)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 9 con; 0-3 aty)
% Number of variables : 94 ( 0 ^; 91 !; 3 ?; 94 :)
% Comments :
%------------------------------------------------------------------------------
thf(sequential_type,type,
sequential: $i > $i > $o ).
thf(length_of_type,type,
length_of: $i > $i ).
thf(sk__7_type,type,
sk__7: $i > $i ).
thf(sk__8_type,type,
sk__8: $i > $i > $i ).
thf(minus_type,type,
minus: $i > $i > $i ).
thf(graph_type,type,
graph: $i ).
thf(sk__11_type,type,
sk__11: $i ).
thf(precedes_type,type,
precedes: $i > $i > $i > $o ).
thf(number_of_in_type,type,
number_of_in: $i > $i > $i ).
thf(sk__9_type,type,
sk__9: $i ).
thf(sequential_pairs_type,type,
sequential_pairs: $i ).
thf(sk__10_type,type,
sk__10: $i ).
thf(on_path_type,type,
on_path: $i > $i > $o ).
thf(sk__6_type,type,
sk__6: $i > $i ).
thf(triangle_type,type,
triangle: $i > $i > $i > $o ).
thf(shortest_path_type,type,
shortest_path: $i > $i > $i > $o ).
thf(less_or_equal_type,type,
less_or_equal: $i > $i > $o ).
thf(n1_type,type,
n1: $i ).
thf(path_type,type,
path: $i > $i > $i > $o ).
thf(complete_type,type,
complete: $o ).
thf(triangles_type,type,
triangles: $i ).
thf(maximal_path_length,conjecture,
( complete
=> ! [P: $i,V1: $i,V2: $i] :
( ( shortest_path @ V1 @ V2 @ P )
=> ( less_or_equal @ ( minus @ ( length_of @ P ) @ n1 ) @ ( number_of_in @ triangles @ graph ) ) ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ( complete
=> ! [P: $i,V1: $i,V2: $i] :
( ( shortest_path @ V1 @ V2 @ P )
=> ( less_or_equal @ ( minus @ ( length_of @ P ) @ n1 ) @ ( number_of_in @ triangles @ graph ) ) ) ),
inference('cnf.neg',[status(esa)],[maximal_path_length]) ).
thf(zip_derived_cl61,plain,
~ ( less_or_equal @ ( minus @ ( length_of @ sk__9 ) @ n1 ) @ ( number_of_in @ triangles @ graph ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl62,plain,
shortest_path @ sk__10 @ sk__11 @ sk__9,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(shortest_path_defn,axiom,
! [V1: $i,V2: $i,SP: $i] :
( ( shortest_path @ V1 @ V2 @ SP )
<=> ( ( path @ V1 @ V2 @ SP )
& ( V1 != V2 )
& ! [P: $i] :
( ( path @ V1 @ V2 @ P )
=> ( less_or_equal @ ( length_of @ SP ) @ ( length_of @ P ) ) ) ) ) ).
thf(zip_derived_cl38,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( path @ X0 @ X1 @ X2 )
| ~ ( shortest_path @ X0 @ X1 @ X2 ) ),
inference(cnf,[status(esa)],[shortest_path_defn]) ).
thf(zip_derived_cl69,plain,
path @ sk__10 @ sk__11 @ sk__9,
inference('sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl38]) ).
thf(path_length_sequential_pairs,axiom,
! [V1: $i,V2: $i,P: $i] :
( ( path @ V1 @ V2 @ P )
=> ( ( number_of_in @ sequential_pairs @ P )
= ( minus @ ( length_of @ P ) @ n1 ) ) ) ).
thf(zip_derived_cl53,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( number_of_in @ sequential_pairs @ X0 )
= ( minus @ ( length_of @ X0 ) @ n1 ) )
| ~ ( path @ X1 @ X2 @ X0 ) ),
inference(cnf,[status(esa)],[path_length_sequential_pairs]) ).
thf(zip_derived_cl80,plain,
( ( number_of_in @ sequential_pairs @ sk__9 )
= ( minus @ ( length_of @ sk__9 ) @ n1 ) ),
inference('sup-',[status(thm)],[zip_derived_cl69,zip_derived_cl53]) ).
thf(zip_derived_cl82,plain,
~ ( less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ) ),
inference(demod,[status(thm)],[zip_derived_cl61,zip_derived_cl80]) ).
thf(zip_derived_cl69_001,plain,
path @ sk__10 @ sk__11 @ sk__9,
inference('sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl38]) ).
thf(zip_derived_cl62_002,plain,
shortest_path @ sk__10 @ sk__11 @ sk__9,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl69_003,plain,
path @ sk__10 @ sk__11 @ sk__9,
inference('sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl38]) ).
thf(sequential_pairs_and_triangles,axiom,
! [P: $i,V1: $i,V2: $i] :
( ( ( path @ V1 @ V2 @ P )
& ! [E1: $i,E2: $i] :
( ( ( on_path @ E1 @ P )
& ( on_path @ E2 @ P )
& ( sequential @ E1 @ E2 ) )
=> ? [E3: $i] : ( triangle @ E1 @ E2 @ E3 ) ) )
=> ( ( number_of_in @ sequential_pairs @ P )
= ( number_of_in @ triangles @ P ) ) ) ).
thf(zip_derived_cl56,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( number_of_in @ sequential_pairs @ X0 )
= ( number_of_in @ triangles @ X0 ) )
| ( on_path @ ( sk__7 @ X0 ) @ X0 )
| ~ ( path @ X1 @ X2 @ X0 ) ),
inference(cnf,[status(esa)],[sequential_pairs_and_triangles]) ).
thf(zip_derived_cl107,plain,
( ( on_path @ ( sk__7 @ sk__9 ) @ sk__9 )
| ( ( number_of_in @ sequential_pairs @ sk__9 )
= ( number_of_in @ triangles @ sk__9 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl69,zip_derived_cl56]) ).
thf(graph_has_them_all,axiom,
! [Things: $i,InThese: $i] : ( less_or_equal @ ( number_of_in @ Things @ InThese ) @ ( number_of_in @ Things @ graph ) ) ).
thf(zip_derived_cl58,plain,
! [X0: $i,X1: $i] : ( less_or_equal @ ( number_of_in @ X0 @ X1 ) @ ( number_of_in @ X0 @ graph ) ),
inference(cnf,[status(esa)],[graph_has_them_all]) ).
thf(zip_derived_cl108,plain,
( ( less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ) )
| ( on_path @ ( sk__7 @ sk__9 ) @ sk__9 ) ),
inference('sup+',[status(thm)],[zip_derived_cl107,zip_derived_cl58]) ).
thf(zip_derived_cl82_004,plain,
~ ( less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ) ),
inference(demod,[status(thm)],[zip_derived_cl61,zip_derived_cl80]) ).
thf(zip_derived_cl109,plain,
on_path @ ( sk__7 @ sk__9 ) @ sk__9,
inference(clc,[status(thm)],[zip_derived_cl108,zip_derived_cl82]) ).
thf(zip_derived_cl69_005,plain,
path @ sk__10 @ sk__11 @ sk__9,
inference('sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl38]) ).
thf(zip_derived_cl57,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( number_of_in @ sequential_pairs @ X0 )
= ( number_of_in @ triangles @ X0 ) )
| ( on_path @ ( sk__6 @ X0 ) @ X0 )
| ~ ( path @ X1 @ X2 @ X0 ) ),
inference(cnf,[status(esa)],[sequential_pairs_and_triangles]) ).
thf(zip_derived_cl148,plain,
( ( on_path @ ( sk__6 @ sk__9 ) @ sk__9 )
| ( ( number_of_in @ sequential_pairs @ sk__9 )
= ( number_of_in @ triangles @ sk__9 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl69,zip_derived_cl57]) ).
thf(zip_derived_cl58_006,plain,
! [X0: $i,X1: $i] : ( less_or_equal @ ( number_of_in @ X0 @ X1 ) @ ( number_of_in @ X0 @ graph ) ),
inference(cnf,[status(esa)],[graph_has_them_all]) ).
thf(zip_derived_cl149,plain,
( ( less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ) )
| ( on_path @ ( sk__6 @ sk__9 ) @ sk__9 ) ),
inference('sup+',[status(thm)],[zip_derived_cl148,zip_derived_cl58]) ).
thf(zip_derived_cl82_007,plain,
~ ( less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ) ),
inference(demod,[status(thm)],[zip_derived_cl61,zip_derived_cl80]) ).
thf(zip_derived_cl150,plain,
on_path @ ( sk__6 @ sk__9 ) @ sk__9,
inference(clc,[status(thm)],[zip_derived_cl149,zip_derived_cl82]) ).
thf(zip_derived_cl69_008,plain,
path @ sk__10 @ sk__11 @ sk__9,
inference('sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl38]) ).
thf(precedes_defn,axiom,
! [P: $i,V1: $i,V2: $i] :
( ( path @ V1 @ V2 @ P )
=> ! [E1: $i,E2: $i] :
( ( ( on_path @ E1 @ P )
& ( on_path @ E2 @ P )
& ( ( sequential @ E1 @ E2 )
| ? [E3: $i] :
( ( precedes @ E3 @ E2 @ P )
& ( sequential @ E1 @ E3 ) ) ) )
=> ( precedes @ E1 @ E2 @ P ) ) ) ).
thf(zip_derived_cl32,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( precedes @ X0 @ X1 @ X2 )
| ~ ( sequential @ X0 @ X1 )
| ~ ( on_path @ X1 @ X2 )
| ~ ( on_path @ X0 @ X2 )
| ~ ( path @ X3 @ X4 @ X2 ) ),
inference(cnf,[status(esa)],[precedes_defn]) ).
thf(zip_derived_cl78,plain,
! [X0: $i,X1: $i] :
( ~ ( on_path @ X0 @ sk__9 )
| ~ ( on_path @ X1 @ sk__9 )
| ~ ( sequential @ X0 @ X1 )
| ( precedes @ X0 @ X1 @ sk__9 ) ),
inference('sup-',[status(thm)],[zip_derived_cl69,zip_derived_cl32]) ).
thf(sequential_is_triangle,axiom,
( complete
=> ! [V1: $i,V2: $i,E1: $i,E2: $i,P: $i] :
( ( ( shortest_path @ V1 @ V2 @ P )
& ( precedes @ E1 @ E2 @ P )
& ( sequential @ E1 @ E2 ) )
=> ? [E3: $i] : ( triangle @ E1 @ E2 @ E3 ) ) ) ).
thf(zip_derived_cl59,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ ( precedes @ X0 @ X1 @ X2 )
| ~ ( shortest_path @ X3 @ X4 @ X2 )
| ~ ( sequential @ X0 @ X1 )
| ( triangle @ X0 @ X1 @ ( sk__8 @ X1 @ X0 ) )
| ~ complete ),
inference(cnf,[status(esa)],[sequential_is_triangle]) ).
thf(zip_derived_cl60,plain,
complete,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl89,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ ( precedes @ X0 @ X1 @ X2 )
| ~ ( shortest_path @ X3 @ X4 @ X2 )
| ~ ( sequential @ X0 @ X1 )
| ( triangle @ X0 @ X1 @ ( sk__8 @ X1 @ X0 ) ) ),
inference(demod,[status(thm)],[zip_derived_cl59,zip_derived_cl60]) ).
thf(zip_derived_cl134,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ( sequential @ X1 @ X0 )
| ~ ( on_path @ X0 @ sk__9 )
| ~ ( on_path @ X1 @ sk__9 )
| ( triangle @ X1 @ X0 @ ( sk__8 @ X0 @ X1 ) )
| ~ ( sequential @ X1 @ X0 )
| ~ ( shortest_path @ X3 @ X2 @ sk__9 ) ),
inference('sup-',[status(thm)],[zip_derived_cl78,zip_derived_cl89]) ).
thf(zip_derived_cl137,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ( shortest_path @ X3 @ X2 @ sk__9 )
| ( triangle @ X1 @ X0 @ ( sk__8 @ X0 @ X1 ) )
| ~ ( on_path @ X1 @ sk__9 )
| ~ ( on_path @ X0 @ sk__9 )
| ~ ( sequential @ X1 @ X0 ) ),
inference(simplify,[status(thm)],[zip_derived_cl134]) ).
thf(zip_derived_cl174,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ( sequential @ ( sk__6 @ sk__9 ) @ X0 )
| ~ ( on_path @ X0 @ sk__9 )
| ( triangle @ ( sk__6 @ sk__9 ) @ X0 @ ( sk__8 @ X0 @ ( sk__6 @ sk__9 ) ) )
| ~ ( shortest_path @ X2 @ X1 @ sk__9 ) ),
inference('sup-',[status(thm)],[zip_derived_cl150,zip_derived_cl137]) ).
thf(zip_derived_cl561,plain,
! [X0: $i,X1: $i] :
( ~ ( shortest_path @ X1 @ X0 @ sk__9 )
| ( triangle @ ( sk__6 @ sk__9 ) @ ( sk__7 @ sk__9 ) @ ( sk__8 @ ( sk__7 @ sk__9 ) @ ( sk__6 @ sk__9 ) ) )
| ~ ( sequential @ ( sk__6 @ sk__9 ) @ ( sk__7 @ sk__9 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl109,zip_derived_cl174]) ).
thf(zip_derived_cl69_009,plain,
path @ sk__10 @ sk__11 @ sk__9,
inference('sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl38]) ).
thf(zip_derived_cl55,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( number_of_in @ sequential_pairs @ X0 )
= ( number_of_in @ triangles @ X0 ) )
| ( sequential @ ( sk__6 @ X0 ) @ ( sk__7 @ X0 ) )
| ~ ( path @ X1 @ X2 @ X0 ) ),
inference(cnf,[status(esa)],[sequential_pairs_and_triangles]) ).
thf(zip_derived_cl204,plain,
( ( sequential @ ( sk__6 @ sk__9 ) @ ( sk__7 @ sk__9 ) )
| ( ( number_of_in @ sequential_pairs @ sk__9 )
= ( number_of_in @ triangles @ sk__9 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl69,zip_derived_cl55]) ).
thf(zip_derived_cl58_010,plain,
! [X0: $i,X1: $i] : ( less_or_equal @ ( number_of_in @ X0 @ X1 ) @ ( number_of_in @ X0 @ graph ) ),
inference(cnf,[status(esa)],[graph_has_them_all]) ).
thf(zip_derived_cl205,plain,
( ( less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ) )
| ( sequential @ ( sk__6 @ sk__9 ) @ ( sk__7 @ sk__9 ) ) ),
inference('sup+',[status(thm)],[zip_derived_cl204,zip_derived_cl58]) ).
thf(zip_derived_cl82_011,plain,
~ ( less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ) ),
inference(demod,[status(thm)],[zip_derived_cl61,zip_derived_cl80]) ).
thf(zip_derived_cl206,plain,
sequential @ ( sk__6 @ sk__9 ) @ ( sk__7 @ sk__9 ),
inference(clc,[status(thm)],[zip_derived_cl205,zip_derived_cl82]) ).
thf(zip_derived_cl563,plain,
! [X0: $i,X1: $i] :
( ~ ( shortest_path @ X1 @ X0 @ sk__9 )
| ( triangle @ ( sk__6 @ sk__9 ) @ ( sk__7 @ sk__9 ) @ ( sk__8 @ ( sk__7 @ sk__9 ) @ ( sk__6 @ sk__9 ) ) ) ),
inference(demod,[status(thm)],[zip_derived_cl561,zip_derived_cl206]) ).
thf(zip_derived_cl775,plain,
triangle @ ( sk__6 @ sk__9 ) @ ( sk__7 @ sk__9 ) @ ( sk__8 @ ( sk__7 @ sk__9 ) @ ( sk__6 @ sk__9 ) ),
inference('sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl563]) ).
thf(zip_derived_cl54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( ( number_of_in @ sequential_pairs @ X0 )
= ( number_of_in @ triangles @ X0 ) )
| ~ ( triangle @ ( sk__6 @ X0 ) @ ( sk__7 @ X0 ) @ X1 )
| ~ ( path @ X2 @ X3 @ X0 ) ),
inference(cnf,[status(esa)],[sequential_pairs_and_triangles]) ).
thf(zip_derived_cl782,plain,
! [X0: $i,X1: $i] :
( ~ ( path @ X1 @ X0 @ sk__9 )
| ( ( number_of_in @ sequential_pairs @ sk__9 )
= ( number_of_in @ triangles @ sk__9 ) ) ),
inference('sup-',[status(thm)],[zip_derived_cl775,zip_derived_cl54]) ).
thf(zip_derived_cl801,plain,
( ( number_of_in @ sequential_pairs @ sk__9 )
= ( number_of_in @ triangles @ sk__9 ) ),
inference('sup-',[status(thm)],[zip_derived_cl69,zip_derived_cl782]) ).
thf(zip_derived_cl58_012,plain,
! [X0: $i,X1: $i] : ( less_or_equal @ ( number_of_in @ X0 @ X1 ) @ ( number_of_in @ X0 @ graph ) ),
inference(cnf,[status(esa)],[graph_has_them_all]) ).
thf(zip_derived_cl824,plain,
less_or_equal @ ( number_of_in @ sequential_pairs @ sk__9 ) @ ( number_of_in @ triangles @ graph ),
inference('sup+',[status(thm)],[zip_derived_cl801,zip_derived_cl58]) ).
thf(zip_derived_cl825,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl82,zip_derived_cl824]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRA002+3 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.00/0.14 % Command : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.KiQOCPeUIV true
% 0.17/0.35 % Computer : n016.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Sun Aug 27 04:17:58 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.17/0.35 % Running portfolio for 300 s
% 0.17/0.35 % File : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.35 % Number of cores: 8
% 0.17/0.36 % Python version: Python 3.6.8
% 0.17/0.36 % Running in FO mode
% 0.21/0.65 % Total configuration time : 435
% 0.21/0.65 % Estimated wc time : 1092
% 0.21/0.65 % Estimated cpu time (7 cpus) : 156.0
% 0.21/0.73 % /export/starexec/sandbox/solver/bin/fo/fo6_bce.sh running for 75s
% 0.21/0.74 % /export/starexec/sandbox/solver/bin/fo/fo1_av.sh running for 75s
% 0.21/0.74 % /export/starexec/sandbox/solver/bin/fo/fo3_bce.sh running for 75s
% 0.21/0.75 % /export/starexec/sandbox/solver/bin/fo/fo7.sh running for 63s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/fo/fo13.sh running for 50s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/fo/fo5.sh running for 50s
% 0.21/0.77 % /export/starexec/sandbox/solver/bin/fo/fo4.sh running for 50s
% 2.07/1.01 % Solved by fo/fo7.sh.
% 2.07/1.01 % done 305 iterations in 0.237s
% 2.07/1.01 % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 2.07/1.01 % SZS output start Refutation
% See solution above
% 2.07/1.01
% 2.07/1.01
% 2.07/1.01 % Terminating...
% 2.34/1.10 % Runner terminated.
% 2.34/1.10 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------