%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : GRA002+4 : TPTP v9.2.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.1fWCoOxY8z true
% Computer : n025.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 Oct 2 04:35:11 PM UTC 2025
% Result : Theorem 1.12s 0.71s
% Output : Refutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 72 ( 25 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 256 ( 21 ~; 16 |; 7 &; 197 @)
% ( 1 <=>; 11 =>; 2 <=; 1 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 20 usr; 10 con; 0-3 aty)
% Number of variables : 55 ( 0 ^; 54 !; 1 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
thf(edge_type,type,
edge: $i > $o ).
thf(length_of_type,type,
length_of: $i > $i ).
thf(sk__8_type,type,
sk__8: $i ).
thf(sk__9_type,type,
sk__9: $i ).
thf(minus_type,type,
minus: $i > $i > $i ).
thf(graph_type,type,
graph: $i ).
thf(vertex_type,type,
vertex: $i > $o ).
thf(number_of_in_type,type,
number_of_in: $i > $i > $i ).
thf(head_of_type,type,
head_of: $i > $i ).
thf(sequential_pairs_type,type,
sequential_pairs: $i ).
thf(sk__type,type,
sk_: $i > $i > $i ).
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(tail_of_type,type,
tail_of: $i > $i ).
thf(path_type,type,
path: $i > $i > $i > $o ).
thf(sk__10_type,type,
sk__10: $i ).
thf(edges_type,type,
edges: $i ).
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__8 ) @ n1 ) @ ( number_of_in @ triangles @ graph ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(zip_derived_cl62,plain,
shortest_path @ sk__9 @ sk__10 @ sk__8,
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_cl109,plain,
path @ sk__9 @ sk__10 @ sk__8,
inference('s_sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl38]) ).
thf(length_defn,axiom,
! [V1: $i,V2: $i,P: $i] :
( ( path @ V1 @ V2 @ P )
=> ( ( length_of @ P )
= ( number_of_in @ edges @ P ) ) ) ).
thf(zip_derived_cl52,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( length_of @ X0 )
= ( number_of_in @ edges @ X0 ) )
| ~ ( path @ X1 @ X2 @ X0 ) ),
inference(cnf,[status(esa)],[length_defn]) ).
thf(zip_derived_cl112,plain,
( ( length_of @ sk__8 )
= ( number_of_in @ edges @ sk__8 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl109,zip_derived_cl52]) ).
thf(zip_derived_cl113,plain,
~ ( less_or_equal @ ( minus @ ( number_of_in @ edges @ sk__8 ) @ n1 ) @ ( number_of_in @ triangles @ graph ) ),
inference(demod,[status(thm)],[zip_derived_cl61,zip_derived_cl112]) ).
thf(zip_derived_cl109_001,plain,
path @ sk__9 @ sk__10 @ sk__8,
inference('s_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_cl122,plain,
( ( number_of_in @ sequential_pairs @ sk__8 )
= ( minus @ ( length_of @ sk__8 ) @ n1 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl109,zip_derived_cl53]) ).
thf(zip_derived_cl112_002,plain,
( ( length_of @ sk__8 )
= ( number_of_in @ edges @ sk__8 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl109,zip_derived_cl52]) ).
thf(zip_derived_cl123,plain,
( ( number_of_in @ sequential_pairs @ sk__8 )
= ( minus @ ( number_of_in @ edges @ sk__8 ) @ n1 ) ),
inference(demod,[status(thm)],[zip_derived_cl122,zip_derived_cl112]) ).
thf(zip_derived_cl62_003,plain,
shortest_path @ sk__9 @ sk__10 @ sk__8,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(triangles_and_sequential_pairs,axiom,
( complete
=> ! [P: $i,V1: $i,V2: $i] :
( ( shortest_path @ V1 @ V2 @ P )
=> ( ( number_of_in @ sequential_pairs @ P )
= ( number_of_in @ triangles @ P ) ) ) ) ).
thf(zip_derived_cl59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ( shortest_path @ X0 @ X1 @ X2 )
| ( ( number_of_in @ sequential_pairs @ X2 )
= ( number_of_in @ triangles @ X2 ) )
| ~ complete ),
inference(cnf,[status(esa)],[triangles_and_sequential_pairs]) ).
thf(zip_derived_cl75,plain,
( ! [X0: $i,X1: $i,X2: $i] :
( ~ ( shortest_path @ X0 @ X1 @ X2 )
| ( ( number_of_in @ sequential_pairs @ X2 )
= ( number_of_in @ triangles @ X2 ) ) )
<= ! [X0: $i,X1: $i,X2: $i] :
( ~ ( shortest_path @ X0 @ X1 @ X2 )
| ( ( number_of_in @ sequential_pairs @ X2 )
= ( number_of_in @ triangles @ X2 ) ) ) ),
inference(split,[status(esa)],[zip_derived_cl59]) ).
thf(complete_properties,axiom,
( complete
=> ! [V1: $i,V2: $i] :
( ( ( vertex @ V1 )
& ( vertex @ V2 )
& ( V1 != V2 ) )
=> ? [E: $i] :
( ( ( ( V1
= ( head_of @ E ) )
& ( V2
= ( tail_of @ E ) ) )
<~> ( ( V2
= ( head_of @ E ) )
& ( V1
= ( tail_of @ E ) ) ) )
& ( edge @ E ) ) ) ) ).
thf(zip_derived_cl3,plain,
! [X0: $i,X1: $i] :
( ( X0
= ( tail_of @ ( sk_ @ X0 @ X1 ) ) )
| ( X1
= ( tail_of @ ( sk_ @ X0 @ X1 ) ) )
| ( X1 = X0 )
| ~ ( vertex @ X0 )
| ~ ( vertex @ X1 )
| ~ complete ),
inference(cnf,[status(esa)],[complete_properties]) ).
thf(zip_derived_cl64,plain,
( ~ complete
<= ~ complete ),
inference(split,[status(esa)],[zip_derived_cl3]) ).
thf(zip_derived_cl60,plain,
complete,
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf('0',plain,
complete,
inference(demod,[status(thm)],[zip_derived_cl64,zip_derived_cl60]) ).
thf('1',plain,
( ! [X0: $i,X1: $i,X2: $i] :
( ~ ( shortest_path @ X0 @ X1 @ X2 )
| ( ( number_of_in @ sequential_pairs @ X2 )
= ( number_of_in @ triangles @ X2 ) ) )
| ~ complete ),
inference(split,[status(esa)],[zip_derived_cl59]) ).
thf('2',plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ( shortest_path @ X0 @ X1 @ X2 )
| ( ( number_of_in @ sequential_pairs @ X2 )
= ( number_of_in @ triangles @ X2 ) ) ),
inference('sat_resolution*',[status(thm)],['0','1']) ).
thf(zip_derived_cl84,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ( shortest_path @ X0 @ X1 @ X2 )
| ( ( number_of_in @ sequential_pairs @ X2 )
= ( number_of_in @ triangles @ X2 ) ) ),
inference(simpl_trail,[status(thm)],[zip_derived_cl75,'2']) ).
thf(zip_derived_cl86,plain,
( ( number_of_in @ sequential_pairs @ sk__8 )
= ( number_of_in @ triangles @ sk__8 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl62,zip_derived_cl84]) ).
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_cl100,plain,
less_or_equal @ ( number_of_in @ sequential_pairs @ sk__8 ) @ ( number_of_in @ triangles @ graph ),
inference('s_sup+',[status(thm)],[zip_derived_cl86,zip_derived_cl58]) ).
thf(zip_derived_cl124,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl113,zip_derived_cl123,zip_derived_cl100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRA002+4 : TPTP v9.2.0. Bugfixed v3.2.0.
% 0.10/0.12 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.1fWCoOxY8z true
% 0.11/0.34 % Computer : n025.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Wed Oct 1 13:52:23 EDT 2025
% 0.11/0.34 % CPUTime :
% 0.11/0.34 % Running portfolio for 300 s
% 0.11/0.34 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.34 % Number of cores: 8
% 0.11/0.34 % Python version: Python 3.6.8
% 0.11/0.34 % Running in FO mode
% 0.20/0.57 % Total configuration time : 435
% 0.20/0.57 % Estimated wc time : 1092
% 0.20/0.57 % Estimated cpu time (7 cpus) : 156.0
% 0.84/0.64 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.84/0.65 % /export/starexec/sandbox2/solver/bin/fo/fo3_bce.sh running for 75s
% 0.84/0.66 % /export/starexec/sandbox2/solver/bin/fo/fo1_av.sh running for 75s
% 0.84/0.66 % /export/starexec/sandbox2/solver/bin/fo/fo7.sh running for 63s
% 0.84/0.67 % /export/starexec/sandbox2/solver/bin/fo/fo13.sh running for 50s
% 0.84/0.67 % /export/starexec/sandbox2/solver/bin/fo/fo5.sh running for 50s
% 0.84/0.68 % /export/starexec/sandbox2/solver/bin/fo/fo4.sh running for 50s
% 1.12/0.71 % Solved by fo/fo1_av.sh.
% 1.12/0.71 % done 57 iterations in 0.026s
% 1.12/0.71 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.12/0.71 % SZS output start Refutation
% See solution above
% 1.12/0.71
% 1.12/0.71
% 1.12/0.71 % Terminating...
% 1.47/0.79 % Runner terminated.
% 1.47/0.80 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------