%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRA014+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:40:47 AM UTC 2026
% Result : Theorem 0.66s 1.01s
% Output : Proof 0.66s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(red_clique,axiom,
! [A,B,C] :
( ( red(A,C)
& red(B,C)
& red(A,B) )
=> goal ),
file('theBenchmark.p',red_clique) ).
fof(green_clique,axiom,
! [A,B,C] :
( ( green(A,C)
& green(B,C)
& green(A,B) )
=> goal ),
file('theBenchmark.p',green_clique) ).
fof(ordering,axiom,
( less_than(n5,n6)
& less_than(n4,n5)
& less_than(n3,n4)
& less_than(n2,n3)
& less_than(n1,n2) ),
file('theBenchmark.p',ordering) ).
fof(less_than_transitive,axiom,
! [A,B,C] :
( ( less_than(B,C)
& less_than(A,B) )
=> less_than(A,C) ),
file('theBenchmark.p',less_than_transitive) ).
fof(partition,axiom,
! [A,B] :
( less_than(A,B)
=> ( green(A,B)
| red(A,B) ) ),
file('theBenchmark.p',partition) ).
fof(goal_to_be_proved,conjecture,
goal,
file('theBenchmark.p',goal_to_be_proved) ).
fof(f_1_1,plain,
! [A,B,C] :
( goal
| ~ red(A,C)
| ~ red(B,C)
| ~ red(A,B) ),
inference(fof_nnf,[status(thm)],[red_clique]) ).
fof(f_1_2,plain,
! [U_2,U_1,U_0] :
( goal
| ~ red(U_2,U_0)
| ~ red(U_1,U_0)
| ~ red(U_2,U_1) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_2,U_1] :
( ! [U_0] :
( ~ red(U_2,U_0)
| ~ red(U_1,U_0) )
| ~ red(U_2,U_1) )
| goal ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ red(U_2,U_0)
| ~ red(U_1,U_0)
| ~ red(U_2,U_1)
| goal ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [A,B,C] :
( goal
| ~ green(A,C)
| ~ green(B,C)
| ~ green(A,B) ),
inference(fof_nnf,[status(thm)],[green_clique]) ).
fof(f_2_2,plain,
! [U_5,U_4,U_3] :
( goal
| ~ green(U_5,U_3)
| ~ green(U_4,U_3)
| ~ green(U_5,U_4) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_5,U_4] :
( ! [U_3] :
( ~ green(U_5,U_3)
| ~ green(U_4,U_3) )
| ~ green(U_5,U_4) )
| goal ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( ~ green(U_5,U_3)
| ~ green(U_4,U_3)
| ~ green(U_5,U_4)
| goal ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
( less_than(n5,n6)
& less_than(n4,n5)
& less_than(n3,n4)
& less_than(n2,n3)
& less_than(n1,n2) ),
inference(fof_nnf,[status(thm)],[ordering]) ).
cnf(f_3_2,plain,
less_than(n1,n2),
inference(clausify,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
less_than(n2,n3),
inference(clausify,[status(thm)],[f_3_1]) ).
cnf(f_3_4,plain,
less_than(n3,n4),
inference(clausify,[status(thm)],[f_3_1]) ).
cnf(f_3_5,plain,
less_than(n4,n5),
inference(clausify,[status(thm)],[f_3_1]) ).
cnf(f_3_6,plain,
less_than(n5,n6),
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
! [A,B,C] :
( less_than(A,C)
| ~ less_than(B,C)
| ~ less_than(A,B) ),
inference(fof_nnf,[status(thm)],[less_than_transitive]) ).
fof(f_4_2,plain,
! [U_8,U_7,U_6] :
( less_than(U_8,U_6)
| ~ less_than(U_7,U_6)
| ~ less_than(U_8,U_7) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
( less_than(U_8,U_6)
| ~ less_than(U_7,U_6)
| ~ less_than(U_8,U_7) ),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,plain,
! [A,B] :
( green(A,B)
| red(A,B)
| ~ less_than(A,B) ),
inference(fof_nnf,[status(thm)],[partition]) ).
fof(f_5_2,plain,
! [U_10,U_9] :
( green(U_10,U_9)
| red(U_10,U_9)
| ~ less_than(U_10,U_9) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
( green(U_10,U_9)
| red(U_10,U_9)
| ~ less_than(U_10,U_9) ),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_1,negated_conjecture,
~ goal,
inference(negate,[status(cth)],[goal_to_be_proved]) ).
fof(f_6_2,negated_conjecture,
~ goal,
inference(definitional_conversion,[status(esa)],[f_6_1]) ).
cnf(f_6_3,negated_conjecture,
~ goal,
inference(clausify,[status(thm)],[f_6_2]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA014+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 19 08:19:38 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.66/1.01 % SZS status Theorem for theBenchmark
% 0.66/1.01 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------