%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEV515+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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 09:00:41 AM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : Proof 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(nc1,conjecture,
( ( ~ ? [A] :
! [B] :
( ( g_true_only(B,B)
& g_false_only(B,A) )
| ( g_false_only(B,B)
& g_true_only(B,A) ) )
& ? [A] :
( ~ ? [B] :
( ( ( g_both(B,B)
| g_false_only(B,B) )
& g_false_only(B,A) )
| ( ( g_true_only(B,B)
| g_false_only(B,B) )
& g_both(B,A) )
| ( ( g_true_only(B,B)
| g_both(B,B) )
& g_true_only(B,A) ) )
& ? [B] :
( g_both(B,B)
& g_both(B,A) ) ) )
| ! [A] :
? [B] :
( ( ( g_both(B,B)
| g_false_only(B,B) )
& g_false_only(B,A) )
| ( ( g_true_only(B,B)
| g_false_only(B,B) )
& g_both(B,A) )
| ( ( g_true_only(B,B)
| g_both(B,B) )
& g_true_only(B,A) ) ) ),
file('theBenchmark.p',nc1) ).
fof(true_only_g,axiom,
! [X_2,X_1] :
( g_true_only(X_2,X_1)
<=> ( ~ g_false(X_2,X_1)
& g_true(X_2,X_1) ) ),
file('theBenchmark.p',true_only_g) ).
fof(both_g,axiom,
! [X_2,X_1] :
( g_both(X_2,X_1)
<=> ( g_false(X_2,X_1)
& g_true(X_2,X_1) ) ),
file('theBenchmark.p',both_g) ).
fof(false_only_g,axiom,
! [X_2,X_1] :
( g_false_only(X_2,X_1)
<=> ( ~ g_true(X_2,X_1)
& g_false(X_2,X_1) ) ),
file('theBenchmark.p',false_only_g) ).
fof(exhaustion_g,axiom,
! [X_2,X_1] :
( g_false_only(X_2,X_1)
| g_both(X_2,X_1)
| g_true_only(X_2,X_1) ),
file('theBenchmark.p',exhaustion_g) ).
fof(f_1_1,negated_conjecture,
~ ( ( ~ ? [A] :
! [B] :
( ( g_true_only(B,B)
& g_false_only(B,A) )
| ( g_false_only(B,B)
& g_true_only(B,A) ) )
& ? [A] :
( ~ ? [B] :
( ( ( g_both(B,B)
| g_false_only(B,B) )
& g_false_only(B,A) )
| ( ( g_true_only(B,B)
| g_false_only(B,B) )
& g_both(B,A) )
| ( ( g_true_only(B,B)
| g_both(B,B) )
& g_true_only(B,A) ) )
& ? [B] :
( g_both(B,B)
& g_both(B,A) ) ) )
| ! [A] :
? [B] :
( ( ( g_both(B,B)
| g_false_only(B,B) )
& g_false_only(B,A) )
| ( ( g_true_only(B,B)
| g_false_only(B,B) )
& g_both(B,A) )
| ( ( g_true_only(B,B)
| g_both(B,B) )
& g_true_only(B,A) ) ) ),
inference(negate,[status(cth)],[nc1]) ).
fof(f_1_2,negated_conjecture,
( ( ? [A] :
! [B] :
( ( g_true_only(B,B)
& g_false_only(B,A) )
| ( g_false_only(B,B)
& g_true_only(B,A) ) )
| ! [A] :
( ? [B] :
( ( ( g_both(B,B)
| g_false_only(B,B) )
& g_false_only(B,A) )
| ( ( g_true_only(B,B)
| g_false_only(B,B) )
& g_both(B,A) )
| ( ( g_true_only(B,B)
| g_both(B,B) )
& g_true_only(B,A) ) )
| ! [B] :
( ~ g_both(B,B)
| ~ g_both(B,A) ) ) )
& ? [A] :
! [B] :
( ( ( ~ g_both(B,B)
& ~ g_false_only(B,B) )
| ~ g_false_only(B,A) )
& ( ( ~ g_true_only(B,B)
& ~ g_false_only(B,B) )
| ~ g_both(B,A) )
& ( ( ~ g_true_only(B,B)
& ~ g_both(B,B) )
| ~ g_true_only(B,A) ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ? [U_6] :
! [U_5] :
( ( g_true_only(U_5,U_5)
& g_false_only(U_5,U_6) )
| ( g_false_only(U_5,U_5)
& g_true_only(U_5,U_6) ) )
| ! [U_4] :
( ? [U_3] :
( ( ( g_both(U_3,U_3)
| g_false_only(U_3,U_3) )
& g_false_only(U_3,U_4) )
| ( ( g_true_only(U_3,U_3)
| g_false_only(U_3,U_3) )
& g_both(U_3,U_4) )
| ( ( g_true_only(U_3,U_3)
| g_both(U_3,U_3) )
& g_true_only(U_3,U_4) ) )
| ! [U_2] :
( ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ) ) )
& ? [U_1] :
! [U_0] :
( ( ( ~ g_both(U_0,U_0)
& ~ g_false_only(U_0,U_0) )
| ~ g_false_only(U_0,U_1) )
& ( ( ~ g_true_only(U_0,U_0)
& ~ g_false_only(U_0,U_0) )
| ~ g_both(U_0,U_1) )
& ( ( ~ g_true_only(U_0,U_0)
& ~ g_both(U_0,U_0) )
| ~ g_true_only(U_0,U_1) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ? [U_6] :
! [U_5] :
( ( g_true_only(U_5,U_5)
& g_false_only(U_5,U_6) )
| ( g_false_only(U_5,U_5)
& g_true_only(U_5,U_6) ) )
| ! [U_4] :
( ? [U_12] :
( ( g_both(U_12,U_12)
| g_false_only(U_12,U_12) )
& g_false_only(U_12,U_4) )
| ? [U_11] :
( ( g_true_only(U_11,U_11)
| g_false_only(U_11,U_11) )
& g_both(U_11,U_4) )
| ? [U_10] :
( ( g_true_only(U_10,U_10)
| g_both(U_10,U_10) )
& g_true_only(U_10,U_4) )
| ! [U_2] :
( ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ) ) )
& ? [U_1] :
( ! [U_9] :
( ( ~ g_both(U_9,U_9)
& ~ g_false_only(U_9,U_9) )
| ~ g_false_only(U_9,U_1) )
& ! [U_8] :
( ( ~ g_true_only(U_8,U_8)
& ~ g_false_only(U_8,U_8) )
| ~ g_both(U_8,U_1) )
& ! [U_7] :
( ( ~ g_true_only(U_7,U_7)
& ~ g_both(U_7,U_7) )
| ~ g_true_only(U_7,U_1) ) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ? [U_6] :
! [U_5] :
( ( g_true_only(U_5,U_5)
& g_false_only(U_5,U_6) )
| ( g_false_only(U_5,U_5)
& g_true_only(U_5,U_6) ) )
| ! [U_4] :
( ? [U_12] :
( ( g_both(U_12,U_12)
| g_false_only(U_12,U_12) )
& g_false_only(U_12,U_4) )
| ? [U_11] :
( ( g_true_only(U_11,U_11)
| g_false_only(U_11,U_11) )
& g_both(U_11,U_4) )
| ? [U_10] :
( ( g_true_only(U_10,U_10)
| g_both(U_10,U_10) )
& g_true_only(U_10,U_4) )
| ! [U_2] :
( ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ) ) )
& ! [U_9] :
( ( ~ g_both(U_9,U_9)
& ~ g_false_only(U_9,U_9) )
| ~ g_false_only(U_9,sK1) )
& ! [U_8] :
( ( ~ g_true_only(U_8,U_8)
& ~ g_false_only(U_8,U_8) )
| ~ g_both(U_8,sK1) )
& ! [U_7] :
( ( ~ g_true_only(U_7,U_7)
& ~ g_both(U_7,U_7) )
| ~ g_true_only(U_7,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ? [U_6] :
! [U_5] :
( ( g_true_only(U_5,U_5)
& g_false_only(U_5,U_6) )
| ( g_false_only(U_5,U_5)
& g_true_only(U_5,U_6) ) )
| ! [U_4] :
( ? [U_12] :
( ( g_both(U_12,U_12)
| g_false_only(U_12,U_12) )
& g_false_only(U_12,U_4) )
| ? [U_11] :
( ( g_true_only(U_11,U_11)
| g_false_only(U_11,U_11) )
& g_both(U_11,U_4) )
| ( ( g_true_only(sK2(U_4),sK2(U_4))
| g_both(sK2(U_4),sK2(U_4)) )
& g_true_only(sK2(U_4),U_4) )
| ! [U_2] :
( ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ) ) )
& ! [U_9] :
( ( ~ g_both(U_9,U_9)
& ~ g_false_only(U_9,U_9) )
| ~ g_false_only(U_9,sK1) )
& ! [U_8] :
( ( ~ g_true_only(U_8,U_8)
& ~ g_false_only(U_8,U_8) )
| ~ g_both(U_8,sK1) )
& ! [U_7] :
( ( ~ g_true_only(U_7,U_7)
& ~ g_both(U_7,U_7) )
| ~ g_true_only(U_7,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_10,sK2(U_4))],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ? [U_6] :
! [U_5] :
( ( g_true_only(U_5,U_5)
& g_false_only(U_5,U_6) )
| ( g_false_only(U_5,U_5)
& g_true_only(U_5,U_6) ) )
| ! [U_4] :
( ? [U_12] :
( ( g_both(U_12,U_12)
| g_false_only(U_12,U_12) )
& g_false_only(U_12,U_4) )
| ( ( g_true_only(sK3(U_4),sK3(U_4))
| g_false_only(sK3(U_4),sK3(U_4)) )
& g_both(sK3(U_4),U_4) )
| ( ( g_true_only(sK2(U_4),sK2(U_4))
| g_both(sK2(U_4),sK2(U_4)) )
& g_true_only(sK2(U_4),U_4) )
| ! [U_2] :
( ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ) ) )
& ! [U_9] :
( ( ~ g_both(U_9,U_9)
& ~ g_false_only(U_9,U_9) )
| ~ g_false_only(U_9,sK1) )
& ! [U_8] :
( ( ~ g_true_only(U_8,U_8)
& ~ g_false_only(U_8,U_8) )
| ~ g_both(U_8,sK1) )
& ! [U_7] :
( ( ~ g_true_only(U_7,U_7)
& ~ g_both(U_7,U_7) )
| ~ g_true_only(U_7,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_11,sK3(U_4))],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ? [U_6] :
! [U_5] :
( ( g_true_only(U_5,U_5)
& g_false_only(U_5,U_6) )
| ( g_false_only(U_5,U_5)
& g_true_only(U_5,U_6) ) )
| ! [U_4] :
( ( ( g_both(sK4(U_4),sK4(U_4))
| g_false_only(sK4(U_4),sK4(U_4)) )
& g_false_only(sK4(U_4),U_4) )
| ( ( g_true_only(sK3(U_4),sK3(U_4))
| g_false_only(sK3(U_4),sK3(U_4)) )
& g_both(sK3(U_4),U_4) )
| ( ( g_true_only(sK2(U_4),sK2(U_4))
| g_both(sK2(U_4),sK2(U_4)) )
& g_true_only(sK2(U_4),U_4) )
| ! [U_2] :
( ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ) ) )
& ! [U_9] :
( ( ~ g_both(U_9,U_9)
& ~ g_false_only(U_9,U_9) )
| ~ g_false_only(U_9,sK1) )
& ! [U_8] :
( ( ~ g_true_only(U_8,U_8)
& ~ g_false_only(U_8,U_8) )
| ~ g_both(U_8,sK1) )
& ! [U_7] :
( ( ~ g_true_only(U_7,U_7)
& ~ g_both(U_7,U_7) )
| ~ g_true_only(U_7,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_12,sK4(U_4))],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ( ! [U_5] :
( ( g_true_only(U_5,U_5)
& g_false_only(U_5,sK5) )
| ( g_false_only(U_5,U_5)
& g_true_only(U_5,sK5) ) )
| ! [U_4] :
( ( ( g_both(sK4(U_4),sK4(U_4))
| g_false_only(sK4(U_4),sK4(U_4)) )
& g_false_only(sK4(U_4),U_4) )
| ( ( g_true_only(sK3(U_4),sK3(U_4))
| g_false_only(sK3(U_4),sK3(U_4)) )
& g_both(sK3(U_4),U_4) )
| ( ( g_true_only(sK2(U_4),sK2(U_4))
| g_both(sK2(U_4),sK2(U_4)) )
& g_true_only(sK2(U_4),U_4) )
| ! [U_2] :
( ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ) ) )
& ! [U_9] :
( ( ~ g_both(U_9,U_9)
& ~ g_false_only(U_9,U_9) )
| ~ g_false_only(U_9,sK1) )
& ! [U_8] :
( ( ~ g_true_only(U_8,U_8)
& ~ g_false_only(U_8,U_8) )
| ~ g_both(U_8,sK1) )
& ! [U_7] :
( ( ~ g_true_only(U_7,U_7)
& ~ g_both(U_7,U_7) )
| ~ g_true_only(U_7,sK1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_6,sK5)],[f_1_8]) ).
fof(f_1_10,negated_conjecture,
( ! [U_5] :
( g_true_only(U_5,U_5)
| ~ sP7(U_5) )
& ! [U_5] :
( g_false_only(U_5,sK5)
| ~ sP7(U_5) )
& ! [U_5] :
( g_false_only(U_5,U_5)
| ~ sP6(U_5) )
& ! [U_5] :
( g_true_only(U_5,sK5)
| ~ sP6(U_5) )
& ! [U_4] :
( g_both(sK4(U_4),sK4(U_4))
| g_false_only(sK4(U_4),sK4(U_4))
| ~ sP5(U_4) )
& ! [U_4] :
( g_false_only(sK4(U_4),U_4)
| ~ sP5(U_4) )
& ! [U_4] :
( g_true_only(sK3(U_4),sK3(U_4))
| g_false_only(sK3(U_4),sK3(U_4))
| ~ sP4(U_4) )
& ! [U_4] :
( g_both(sK3(U_4),U_4)
| ~ sP4(U_4) )
& ! [U_4] :
( g_true_only(sK2(U_4),sK2(U_4))
| g_both(sK2(U_4),sK2(U_4))
| ~ sP3(U_4) )
& ! [U_4] :
( g_true_only(sK2(U_4),U_4)
| ~ sP3(U_4) )
& ! [U_9] :
( ~ g_both(U_9,U_9)
| ~ sP2(U_9) )
& ! [U_9] :
( ~ g_false_only(U_9,U_9)
| ~ sP2(U_9) )
& ! [U_8] :
( ~ g_true_only(U_8,U_8)
| ~ sP1(U_8) )
& ! [U_8] :
( ~ g_false_only(U_8,U_8)
| ~ sP1(U_8) )
& ! [U_7] :
( ~ g_true_only(U_7,U_7)
| ~ sP0(U_7) )
& ! [U_7] :
( ~ g_both(U_7,U_7)
| ~ sP0(U_7) )
& ! [U_4,U_2,U_5] :
( sP7(U_5)
| sP6(U_5)
| sP5(U_4)
| sP4(U_4)
| sP3(U_4)
| ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) )
& ! [U_9] :
( sP2(U_9)
| ~ g_false_only(U_9,sK1) )
& ! [U_8] :
( sP1(U_8)
| ~ g_both(U_8,sK1) )
& ! [U_7] :
( sP0(U_7)
| ~ g_true_only(U_7,sK1) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3,sP4,sP5,sP6,sP7])],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( sP0(U_7)
| ~ g_true_only(U_7,sK1) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_12,negated_conjecture,
( sP1(U_8)
| ~ g_both(U_8,sK1) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_13,negated_conjecture,
( sP2(U_9)
| ~ g_false_only(U_9,sK1) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_14,negated_conjecture,
( sP7(U_5)
| sP6(U_5)
| sP5(U_4)
| sP4(U_4)
| sP3(U_4)
| ~ g_both(U_2,U_2)
| ~ g_both(U_2,U_4) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_15,negated_conjecture,
( ~ g_both(U_7,U_7)
| ~ sP0(U_7) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_16,negated_conjecture,
( ~ g_true_only(U_7,U_7)
| ~ sP0(U_7) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_17,negated_conjecture,
( ~ g_false_only(U_8,U_8)
| ~ sP1(U_8) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_18,negated_conjecture,
( ~ g_true_only(U_8,U_8)
| ~ sP1(U_8) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_19,negated_conjecture,
( ~ g_false_only(U_9,U_9)
| ~ sP2(U_9) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_20,negated_conjecture,
( ~ g_both(U_9,U_9)
| ~ sP2(U_9) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_21,negated_conjecture,
( g_true_only(sK2(U_4),U_4)
| ~ sP3(U_4) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_22,negated_conjecture,
( g_true_only(sK2(U_4),sK2(U_4))
| g_both(sK2(U_4),sK2(U_4))
| ~ sP3(U_4) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_23,negated_conjecture,
( g_both(sK3(U_4),U_4)
| ~ sP4(U_4) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_24,negated_conjecture,
( g_true_only(sK3(U_4),sK3(U_4))
| g_false_only(sK3(U_4),sK3(U_4))
| ~ sP4(U_4) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_25,negated_conjecture,
( g_false_only(sK4(U_4),U_4)
| ~ sP5(U_4) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_26,negated_conjecture,
( g_both(sK4(U_4),sK4(U_4))
| g_false_only(sK4(U_4),sK4(U_4))
| ~ sP5(U_4) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_27,negated_conjecture,
( g_true_only(U_5,sK5)
| ~ sP6(U_5) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_28,negated_conjecture,
( g_false_only(U_5,U_5)
| ~ sP6(U_5) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_29,negated_conjecture,
( g_false_only(U_5,sK5)
| ~ sP7(U_5) ),
inference(clausify,[status(thm)],[f_1_10]) ).
cnf(f_1_30,negated_conjecture,
( g_true_only(U_5,U_5)
| ~ sP7(U_5) ),
inference(clausify,[status(thm)],[f_1_10]) ).
fof(f_2_1,plain,
! [X_2,X_1] :
( ( g_true_only(X_2,X_1)
| g_false(X_2,X_1)
| ~ g_true(X_2,X_1) )
& ( ( ~ g_false(X_2,X_1)
& g_true(X_2,X_1) )
| ~ g_true_only(X_2,X_1) ) ),
inference(fof_nnf,[status(thm)],[true_only_g]) ).
fof(f_2_2,plain,
! [U_14,U_13] :
( ( g_true_only(U_14,U_13)
| g_false(U_14,U_13)
| ~ g_true(U_14,U_13) )
& ( ( ~ g_false(U_14,U_13)
& g_true(U_14,U_13) )
| ~ g_true_only(U_14,U_13) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_18,U_16] :
( g_true_only(U_18,U_16)
| g_false(U_18,U_16)
| ~ g_true(U_18,U_16) )
& ! [U_17,U_15] :
( ( ~ g_false(U_17,U_15)
& g_true(U_17,U_15) )
| ~ g_true_only(U_17,U_15) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
( g_true(U_17,U_15)
| ~ g_true_only(U_17,U_15) ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_5,plain,
( ~ g_false(U_17,U_15)
| ~ g_true_only(U_17,U_15) ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_6,plain,
( g_true_only(U_18,U_16)
| g_false(U_18,U_16)
| ~ g_true(U_18,U_16) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [X_2,X_1] :
( ( g_both(X_2,X_1)
| ~ g_false(X_2,X_1)
| ~ g_true(X_2,X_1) )
& ( ( g_false(X_2,X_1)
& g_true(X_2,X_1) )
| ~ g_both(X_2,X_1) ) ),
inference(fof_nnf,[status(thm)],[both_g]) ).
fof(f_3_2,plain,
! [U_20,U_19] :
( ( g_both(U_20,U_19)
| ~ g_false(U_20,U_19)
| ~ g_true(U_20,U_19) )
& ( ( g_false(U_20,U_19)
& g_true(U_20,U_19) )
| ~ g_both(U_20,U_19) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_24,U_22] :
( g_both(U_24,U_22)
| ~ g_false(U_24,U_22)
| ~ g_true(U_24,U_22) )
& ! [U_23,U_21] :
( ( g_false(U_23,U_21)
& g_true(U_23,U_21) )
| ~ g_both(U_23,U_21) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
cnf(f_3_4,plain,
( g_true(U_23,U_21)
| ~ g_both(U_23,U_21) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,plain,
( g_false(U_23,U_21)
| ~ g_both(U_23,U_21) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_6,plain,
( g_both(U_24,U_22)
| ~ g_false(U_24,U_22)
| ~ g_true(U_24,U_22) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [X_2,X_1] :
( ( g_false_only(X_2,X_1)
| g_true(X_2,X_1)
| ~ g_false(X_2,X_1) )
& ( ( ~ g_true(X_2,X_1)
& g_false(X_2,X_1) )
| ~ g_false_only(X_2,X_1) ) ),
inference(fof_nnf,[status(thm)],[false_only_g]) ).
fof(f_4_2,plain,
! [U_26,U_25] :
( ( g_false_only(U_26,U_25)
| g_true(U_26,U_25)
| ~ g_false(U_26,U_25) )
& ( ( ~ g_true(U_26,U_25)
& g_false(U_26,U_25) )
| ~ g_false_only(U_26,U_25) ) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_30,U_28] :
( g_false_only(U_30,U_28)
| g_true(U_30,U_28)
| ~ g_false(U_30,U_28) )
& ! [U_29,U_27] :
( ( ~ g_true(U_29,U_27)
& g_false(U_29,U_27) )
| ~ g_false_only(U_29,U_27) ) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
cnf(f_4_4,plain,
( g_false(U_29,U_27)
| ~ g_false_only(U_29,U_27) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_5,plain,
( ~ g_true(U_29,U_27)
| ~ g_false_only(U_29,U_27) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_6,plain,
( g_false_only(U_30,U_28)
| g_true(U_30,U_28)
| ~ g_false(U_30,U_28) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
! [X_2,X_1] :
( g_false_only(X_2,X_1)
| g_both(X_2,X_1)
| g_true_only(X_2,X_1) ),
inference(fof_nnf,[status(thm)],[exhaustion_g]) ).
fof(f_5_2,plain,
! [U_32,U_31] :
( g_false_only(U_32,U_31)
| g_both(U_32,U_31)
| g_true_only(U_32,U_31) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
( g_false_only(U_32,U_31)
| g_both(U_32,U_31)
| g_true_only(U_32,U_31) ),
inference(clausify,[status(thm)],[f_5_2]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV515+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n017.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 00:42:25 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.43 % SZS status Theorem for theBenchmark
% 0.11/0.43 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------