%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.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 : n016.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:58:43 AM UTC 2026
% Result : Theorem 232.15s 232.47s
% Output : Proof 234.76s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('theBenchmark.p',antisymmetry_r2_hidden) ).
fof(cc1_funct_1,axiom,
! [A] :
( empty(A)
=> function(A) ),
file('theBenchmark.p',cc1_funct_1) ).
fof(cc2_funct_1,axiom,
! [A] :
( ( function(A)
& empty(A)
& relation(A) )
=> ( one_to_one(A)
& function(A)
& relation(A) ) ),
file('theBenchmark.p',cc2_funct_1) ).
fof(commutativity_k2_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
file('theBenchmark.p',commutativity_k2_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
file('theBenchmark.p',commutativity_k3_xboole_0) ).
fof(d1_wellord1,axiom,
! [A] :
( relation(A)
=> ! [B,C] :
( C = fiber(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(ordered_pair(D,B),A)
& D != B ) ) ) ),
file('theBenchmark.p',d1_wellord1) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_tarski) ).
fof(d5_tarski,axiom,
! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)),
file('theBenchmark.p',d5_tarski) ).
fof(d6_wellord1,axiom,
! [A] :
( relation(A)
=> ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B)) ),
file('theBenchmark.p',d6_wellord1) ).
fof(dt_k1_tarski,axiom,
$true,
file('theBenchmark.p',dt_k1_tarski) ).
fof(dt_k1_wellord1,axiom,
$true,
file('theBenchmark.p',dt_k1_wellord1) ).
fof(dt_k1_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k1_xboole_0) ).
fof(dt_k1_zfmisc_1,axiom,
$true,
file('theBenchmark.p',dt_k1_zfmisc_1) ).
fof(dt_k2_tarski,axiom,
$true,
file('theBenchmark.p',dt_k2_tarski) ).
fof(dt_k2_wellord1,axiom,
! [A,B] :
( relation(A)
=> relation(relation_restriction(A,B)) ),
file('theBenchmark.p',dt_k2_wellord1) ).
fof(dt_k2_zfmisc_1,axiom,
$true,
file('theBenchmark.p',dt_k2_zfmisc_1) ).
fof(dt_k3_xboole_0,axiom,
$true,
file('theBenchmark.p',dt_k3_xboole_0) ).
fof(dt_k4_tarski,axiom,
$true,
file('theBenchmark.p',dt_k4_tarski) ).
fof(dt_m1_subset_1,axiom,
$true,
file('theBenchmark.p',dt_m1_subset_1) ).
fof(existence_m1_subset_1,axiom,
! [A] :
? [B] : element(B,A),
file('theBenchmark.p',existence_m1_subset_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('theBenchmark.p',fc1_xboole_0) ).
fof(fc1_zfmisc_1,axiom,
! [A,B] : ~ empty(ordered_pair(A,B)),
file('theBenchmark.p',fc1_zfmisc_1) ).
fof(idempotence_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,A) = A,
file('theBenchmark.p',idempotence_k3_xboole_0) ).
fof(rc1_funct_1,axiom,
? [A] :
( function(A)
& relation(A) ),
file('theBenchmark.p',rc1_funct_1) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A),
file('theBenchmark.p',rc1_xboole_0) ).
fof(rc2_funct_1,axiom,
? [A] :
( function(A)
& empty(A)
& relation(A) ),
file('theBenchmark.p',rc2_funct_1) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A),
file('theBenchmark.p',rc2_xboole_0) ).
fof(rc3_funct_1,axiom,
? [A] :
( one_to_one(A)
& function(A)
& relation(A) ),
file('theBenchmark.p',rc3_funct_1) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(t16_wellord1,axiom,
! [A,B,C] :
( relation(C)
=> ( in(A,relation_restriction(C,B))
<=> ( in(A,cartesian_product2(B,B))
& in(A,C) ) ) ),
file('theBenchmark.p',t16_wellord1) ).
fof(t1_subset,axiom,
! [A,B] :
( in(A,B)
=> element(A,B) ),
file('theBenchmark.p',t1_subset) ).
fof(t21_wellord1,conjecture,
! [A,B,C] :
( relation(C)
=> subset(fiber(relation_restriction(C,A),B),fiber(C,B)) ),
file('theBenchmark.p',t21_wellord1) ).
fof(t2_boole,axiom,
! [A] : set_intersection2(A,empty_set) = empty_set,
file('theBenchmark.p',t2_boole) ).
fof(t2_subset,axiom,
! [A,B] :
( element(A,B)
=> ( in(A,B)
| empty(B) ) ),
file('theBenchmark.p',t2_subset) ).
fof(t3_subset,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('theBenchmark.p',t3_subset) ).
fof(t4_subset,axiom,
! [A,B,C] :
( ( element(B,powerset(C))
& in(A,B) )
=> element(A,C) ),
file('theBenchmark.p',t4_subset) ).
fof(t5_subset,axiom,
! [A,B,C] :
~ ( empty(C)
& element(B,powerset(C))
& in(A,B) ),
file('theBenchmark.p',t5_subset) ).
fof(t6_boole,axiom,
! [A] :
( empty(A)
=> A = empty_set ),
file('theBenchmark.p',t6_boole) ).
fof(t7_boole,axiom,
! [A,B] :
~ ( empty(B)
& in(A,B) ),
file('theBenchmark.p',t7_boole) ).
fof(t8_boole,axiom,
! [A,B] :
~ ( empty(B)
& A != B
& empty(A) ),
file('theBenchmark.p',t8_boole) ).
fof(f_1_1,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [A] :
( function(A)
| ~ empty(A) ),
inference(fof_nnf,[status(thm)],[cc1_funct_1]) ).
fof(f_2_2,plain,
! [U_2] :
( function(U_2)
| ~ empty(U_2) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( function(U_2)
| ~ empty(U_2) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [A] :
( ( one_to_one(A)
& function(A)
& relation(A) )
| ~ function(A)
| ~ empty(A)
| ~ relation(A) ),
inference(fof_nnf,[status(thm)],[cc2_funct_1]) ).
fof(f_3_2,plain,
! [U_3] :
( ( one_to_one(U_3)
& function(U_3)
& relation(U_3) )
| ~ function(U_3)
| ~ empty(U_3)
| ~ relation(U_3) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( relation(U_3)
| ~ function(U_3)
| ~ empty(U_3)
| ~ relation(U_3) ),
inference(clausify,[status(thm)],[f_3_2]) ).
cnf(f_3_4,plain,
( function(U_3)
| ~ function(U_3)
| ~ empty(U_3)
| ~ relation(U_3) ),
inference(clausify,[status(thm)],[f_3_2]) ).
cnf(f_3_5,plain,
( one_to_one(U_3)
| ~ function(U_3)
| ~ empty(U_3)
| ~ relation(U_3) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,plain,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k2_tarski]) ).
fof(f_4_2,plain,
! [U_5,U_4] : unordered_pair(U_5,U_4) = unordered_pair(U_4,U_5),
inference(variable_rename,[status(thm)],[f_4_1]) ).
cnf(f_4_3,plain,
unordered_pair(U_5,U_4) = unordered_pair(U_4,U_5),
inference(clausify,[status(thm)],[f_4_2]) ).
fof(f_5_1,plain,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(f_5_2,plain,
! [U_7,U_6] : set_intersection2(U_7,U_6) = set_intersection2(U_6,U_7),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
set_intersection2(U_7,U_6) = set_intersection2(U_6,U_7),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_1,plain,
! [A] :
( ! [B,C] :
( ( C = fiber(A,B)
| ? [D] :
( ( ~ in(D,C)
& in(ordered_pair(D,B),A)
& D != B )
| ( ( ~ in(ordered_pair(D,B),A)
| D = B )
& in(D,C) ) ) )
& ( ! [D] :
( ( in(D,C)
| ~ in(ordered_pair(D,B),A)
| D = B )
& ( ( in(ordered_pair(D,B),A)
& D != B )
| ~ in(D,C) ) )
| C != fiber(A,B) ) )
| ~ relation(A) ),
inference(fof_nnf,[status(thm)],[d1_wellord1]) ).
fof(f_6_2,plain,
! [U_12] :
( ! [U_11,U_10] :
( ( U_10 = fiber(U_12,U_11)
| ? [U_9] :
( ( ~ in(U_9,U_10)
& in(ordered_pair(U_9,U_11),U_12)
& U_9 != U_11 )
| ( ( ~ in(ordered_pair(U_9,U_11),U_12)
| U_9 = U_11 )
& in(U_9,U_10) ) ) )
& ( ! [U_8] :
( ( in(U_8,U_10)
| ~ in(ordered_pair(U_8,U_11),U_12)
| U_8 = U_11 )
& ( ( in(ordered_pair(U_8,U_11),U_12)
& U_8 != U_11 )
| ~ in(U_8,U_10) ) )
| U_10 != fiber(U_12,U_11) ) )
| ~ relation(U_12) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
! [U_12] :
( ( ! [U_20,U_18] :
( U_18 = fiber(U_12,U_20)
| ? [U_16] :
( ~ in(U_16,U_18)
& in(ordered_pair(U_16,U_20),U_12)
& U_16 != U_20 )
| ? [U_15] :
( ( ~ in(ordered_pair(U_15,U_20),U_12)
| U_15 = U_20 )
& in(U_15,U_18) ) )
& ! [U_19,U_17] :
( ( ! [U_14] :
( in(U_14,U_17)
| ~ in(ordered_pair(U_14,U_19),U_12)
| U_14 = U_19 )
& ! [U_13] :
( ( in(ordered_pair(U_13,U_19),U_12)
& U_13 != U_19 )
| ~ in(U_13,U_17) ) )
| U_17 != fiber(U_12,U_19) ) )
| ~ relation(U_12) ),
inference(miniscope,[status(thm)],[f_6_2]) ).
fof(f_6_4,plain,
! [U_12] :
( ( ! [U_20,U_18] :
( U_18 = fiber(U_12,U_20)
| ? [U_16] :
( ~ in(U_16,U_18)
& in(ordered_pair(U_16,U_20),U_12)
& U_16 != U_20 )
| ( ( ~ in(ordered_pair(sK1(U_12,U_20,U_18),U_20),U_12)
| sK1(U_12,U_20,U_18) = U_20 )
& in(sK1(U_12,U_20,U_18),U_18) ) )
& ! [U_19,U_17] :
( ( ! [U_14] :
( in(U_14,U_17)
| ~ in(ordered_pair(U_14,U_19),U_12)
| U_14 = U_19 )
& ! [U_13] :
( ( in(ordered_pair(U_13,U_19),U_12)
& U_13 != U_19 )
| ~ in(U_13,U_17) ) )
| U_17 != fiber(U_12,U_19) ) )
| ~ relation(U_12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_15,sK1(U_12,U_20,U_18))],[f_6_3]) ).
fof(f_6_5,plain,
! [U_12] :
( ( ! [U_20,U_18] :
( U_18 = fiber(U_12,U_20)
| ( ~ in(sK2(U_12,U_20,U_18),U_18)
& in(ordered_pair(sK2(U_12,U_20,U_18),U_20),U_12)
& sK2(U_12,U_20,U_18) != U_20 )
| ( ( ~ in(ordered_pair(sK1(U_12,U_20,U_18),U_20),U_12)
| sK1(U_12,U_20,U_18) = U_20 )
& in(sK1(U_12,U_20,U_18),U_18) ) )
& ! [U_19,U_17] :
( ( ! [U_14] :
( in(U_14,U_17)
| ~ in(ordered_pair(U_14,U_19),U_12)
| U_14 = U_19 )
& ! [U_13] :
( ( in(ordered_pair(U_13,U_19),U_12)
& U_13 != U_19 )
| ~ in(U_13,U_17) ) )
| U_17 != fiber(U_12,U_19) ) )
| ~ relation(U_12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_16,sK2(U_12,U_20,U_18))],[f_6_4]) ).
cnf(f_6_6,plain,
( U_13 != U_19
| ~ in(U_13,U_17)
| U_17 != fiber(U_12,U_19)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_7,plain,
( in(ordered_pair(U_13,U_19),U_12)
| ~ in(U_13,U_17)
| U_17 != fiber(U_12,U_19)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_8,plain,
( in(U_14,U_17)
| ~ in(ordered_pair(U_14,U_19),U_12)
| U_14 = U_19
| U_17 != fiber(U_12,U_19)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_9,plain,
( sK2(U_12,U_20,U_18) != U_20
| in(sK1(U_12,U_20,U_18),U_18)
| U_18 = fiber(U_12,U_20)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_10,plain,
( in(ordered_pair(sK2(U_12,U_20,U_18),U_20),U_12)
| in(sK1(U_12,U_20,U_18),U_18)
| U_18 = fiber(U_12,U_20)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_11,plain,
( ~ in(sK2(U_12,U_20,U_18),U_18)
| in(sK1(U_12,U_20,U_18),U_18)
| U_18 = fiber(U_12,U_20)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_12,plain,
( sK2(U_12,U_20,U_18) != U_20
| ~ in(ordered_pair(sK1(U_12,U_20,U_18),U_20),U_12)
| sK1(U_12,U_20,U_18) = U_20
| U_18 = fiber(U_12,U_20)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_13,plain,
( in(ordered_pair(sK2(U_12,U_20,U_18),U_20),U_12)
| ~ in(ordered_pair(sK1(U_12,U_20,U_18),U_20),U_12)
| sK1(U_12,U_20,U_18) = U_20
| U_18 = fiber(U_12,U_20)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
cnf(f_6_14,plain,
( ~ in(sK2(U_12,U_20,U_18),U_18)
| ~ in(ordered_pair(sK1(U_12,U_20,U_18),U_20),U_12)
| sK1(U_12,U_20,U_18) = U_20
| U_18 = fiber(U_12,U_20)
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_6_5]) ).
fof(f_7_1,plain,
! [A,B] :
( ( subset(A,B)
| ? [C] :
( ~ in(C,B)
& in(C,A) ) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[d3_tarski]) ).
fof(f_7_2,plain,
! [U_24,U_23] :
( ( subset(U_24,U_23)
| ? [U_22] :
( ~ in(U_22,U_23)
& in(U_22,U_24) ) )
& ( ! [U_21] :
( in(U_21,U_23)
| ~ in(U_21,U_24) )
| ~ subset(U_24,U_23) ) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
( ! [U_28,U_26] :
( subset(U_28,U_26)
| ? [U_22] :
( ~ in(U_22,U_26)
& in(U_22,U_28) ) )
& ! [U_27,U_25] :
( ! [U_21] :
( in(U_21,U_25)
| ~ in(U_21,U_27) )
| ~ subset(U_27,U_25) ) ),
inference(miniscope,[status(thm)],[f_7_2]) ).
fof(f_7_4,plain,
( ! [U_28,U_26] :
( subset(U_28,U_26)
| ( ~ in(sK3(U_28,U_26),U_26)
& in(sK3(U_28,U_26),U_28) ) )
& ! [U_27,U_25] :
( ! [U_21] :
( in(U_21,U_25)
| ~ in(U_21,U_27) )
| ~ subset(U_27,U_25) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_22,sK3(U_28,U_26))],[f_7_3]) ).
cnf(f_7_5,plain,
( in(U_21,U_25)
| ~ in(U_21,U_27)
| ~ subset(U_27,U_25) ),
inference(clausify,[status(thm)],[f_7_4]) ).
cnf(f_7_6,plain,
( in(sK3(U_28,U_26),U_28)
| subset(U_28,U_26) ),
inference(clausify,[status(thm)],[f_7_4]) ).
cnf(f_7_7,plain,
( ~ in(sK3(U_28,U_26),U_26)
| subset(U_28,U_26) ),
inference(clausify,[status(thm)],[f_7_4]) ).
fof(f_8_1,plain,
! [A,B] : ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)),
inference(fof_nnf,[status(thm)],[d5_tarski]) ).
fof(f_8_2,plain,
! [U_30,U_29] : ordered_pair(U_30,U_29) = unordered_pair(unordered_pair(U_30,U_29),singleton(U_30)),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
ordered_pair(U_30,U_29) = unordered_pair(unordered_pair(U_30,U_29),singleton(U_30)),
inference(clausify,[status(thm)],[f_8_2]) ).
fof(f_9_1,plain,
! [A] :
( ! [B] : relation_restriction(A,B) = set_intersection2(A,cartesian_product2(B,B))
| ~ relation(A) ),
inference(fof_nnf,[status(thm)],[d6_wellord1]) ).
fof(f_9_2,plain,
! [U_32] :
( ! [U_31] : relation_restriction(U_32,U_31) = set_intersection2(U_32,cartesian_product2(U_31,U_31))
| ~ relation(U_32) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
cnf(f_9_3,plain,
( relation_restriction(U_32,U_31) = set_intersection2(U_32,cartesian_product2(U_31,U_31))
| ~ relation(U_32) ),
inference(clausify,[status(thm)],[f_9_2]) ).
fof(f_10_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_tarski]) ).
cnf(f_10_2,plain,
$true,
inference(clausify,[status(thm)],[f_10_1]) ).
fof(f_11_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_wellord1]) ).
cnf(f_11_2,plain,
$true,
inference(clausify,[status(thm)],[f_11_1]) ).
fof(f_12_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_xboole_0]) ).
cnf(f_12_2,plain,
$true,
inference(clausify,[status(thm)],[f_12_1]) ).
fof(f_13_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k1_zfmisc_1]) ).
cnf(f_13_2,plain,
$true,
inference(clausify,[status(thm)],[f_13_1]) ).
fof(f_14_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k2_tarski]) ).
cnf(f_14_2,plain,
$true,
inference(clausify,[status(thm)],[f_14_1]) ).
fof(f_15_1,plain,
! [A,B] :
( relation(relation_restriction(A,B))
| ~ relation(A) ),
inference(fof_nnf,[status(thm)],[dt_k2_wellord1]) ).
fof(f_15_2,plain,
! [U_34,U_33] :
( relation(relation_restriction(U_34,U_33))
| ~ relation(U_34) ),
inference(variable_rename,[status(thm)],[f_15_1]) ).
fof(f_15_3,plain,
! [U_34] :
( ! [U_33] : relation(relation_restriction(U_34,U_33))
| ~ relation(U_34) ),
inference(miniscope,[status(thm)],[f_15_2]) ).
cnf(f_15_4,plain,
( relation(relation_restriction(U_34,U_33))
| ~ relation(U_34) ),
inference(clausify,[status(thm)],[f_15_3]) ).
fof(f_16_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k2_zfmisc_1]) ).
cnf(f_16_2,plain,
$true,
inference(clausify,[status(thm)],[f_16_1]) ).
fof(f_17_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k3_xboole_0]) ).
cnf(f_17_2,plain,
$true,
inference(clausify,[status(thm)],[f_17_1]) ).
fof(f_18_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_k4_tarski]) ).
cnf(f_18_2,plain,
$true,
inference(clausify,[status(thm)],[f_18_1]) ).
fof(f_19_1,plain,
$true,
inference(fof_nnf,[status(thm)],[dt_m1_subset_1]) ).
cnf(f_19_2,plain,
$true,
inference(clausify,[status(thm)],[f_19_1]) ).
fof(f_20_1,plain,
! [A] :
? [B] : element(B,A),
inference(fof_nnf,[status(thm)],[existence_m1_subset_1]) ).
fof(f_20_2,plain,
! [U_36] :
? [U_35] : element(U_35,U_36),
inference(variable_rename,[status(thm)],[f_20_1]) ).
fof(f_20_3,plain,
! [U_36] : element(sK4(U_36),U_36),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_35,sK4(U_36))],[f_20_2]) ).
cnf(f_20_4,plain,
element(sK4(U_36),U_36),
inference(clausify,[status(thm)],[f_20_3]) ).
fof(f_21_1,plain,
empty(empty_set),
inference(fof_nnf,[status(thm)],[fc1_xboole_0]) ).
cnf(f_21_2,plain,
empty(empty_set),
inference(clausify,[status(thm)],[f_21_1]) ).
fof(f_22_1,plain,
! [A,B] : ~ empty(ordered_pair(A,B)),
inference(fof_nnf,[status(thm)],[fc1_zfmisc_1]) ).
fof(f_22_2,plain,
! [U_38,U_37] : ~ empty(ordered_pair(U_38,U_37)),
inference(variable_rename,[status(thm)],[f_22_1]) ).
cnf(f_22_3,plain,
~ empty(ordered_pair(U_38,U_37)),
inference(clausify,[status(thm)],[f_22_2]) ).
fof(f_23_1,plain,
! [A,B] : set_intersection2(A,A) = A,
inference(fof_nnf,[status(thm)],[idempotence_k3_xboole_0]) ).
fof(f_23_2,plain,
! [U_40,U_39] : set_intersection2(U_40,U_40) = U_40,
inference(variable_rename,[status(thm)],[f_23_1]) ).
fof(f_23_3,plain,
! [U_40] : set_intersection2(U_40,U_40) = U_40,
inference(miniscope,[status(thm)],[f_23_2]) ).
cnf(f_23_4,plain,
set_intersection2(U_40,U_40) = U_40,
inference(clausify,[status(thm)],[f_23_3]) ).
fof(f_24_1,plain,
? [A] :
( function(A)
& relation(A) ),
inference(fof_nnf,[status(thm)],[rc1_funct_1]) ).
fof(f_24_2,plain,
? [U_41] :
( function(U_41)
& relation(U_41) ),
inference(variable_rename,[status(thm)],[f_24_1]) ).
fof(f_24_3,plain,
( function(sK5)
& relation(sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_41,sK5)],[f_24_2]) ).
cnf(f_24_4,plain,
relation(sK5),
inference(clausify,[status(thm)],[f_24_3]) ).
cnf(f_24_5,plain,
function(sK5),
inference(clausify,[status(thm)],[f_24_3]) ).
fof(f_25_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_25_2,plain,
? [U_42] : empty(U_42),
inference(variable_rename,[status(thm)],[f_25_1]) ).
fof(f_25_3,plain,
empty(sK6),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_42,sK6)],[f_25_2]) ).
cnf(f_25_4,plain,
empty(sK6),
inference(clausify,[status(thm)],[f_25_3]) ).
fof(f_26_1,plain,
? [A] :
( function(A)
& empty(A)
& relation(A) ),
inference(fof_nnf,[status(thm)],[rc2_funct_1]) ).
fof(f_26_2,plain,
? [U_43] :
( function(U_43)
& empty(U_43)
& relation(U_43) ),
inference(variable_rename,[status(thm)],[f_26_1]) ).
fof(f_26_3,plain,
( function(sK7)
& empty(sK7)
& relation(sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_43,sK7)],[f_26_2]) ).
cnf(f_26_4,plain,
relation(sK7),
inference(clausify,[status(thm)],[f_26_3]) ).
cnf(f_26_5,plain,
empty(sK7),
inference(clausify,[status(thm)],[f_26_3]) ).
cnf(f_26_6,plain,
function(sK7),
inference(clausify,[status(thm)],[f_26_3]) ).
fof(f_27_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_27_2,plain,
? [U_44] : ~ empty(U_44),
inference(variable_rename,[status(thm)],[f_27_1]) ).
fof(f_27_3,plain,
~ empty(sK8),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_44,sK8)],[f_27_2]) ).
cnf(f_27_4,plain,
~ empty(sK8),
inference(clausify,[status(thm)],[f_27_3]) ).
fof(f_28_1,plain,
? [A] :
( one_to_one(A)
& function(A)
& relation(A) ),
inference(fof_nnf,[status(thm)],[rc3_funct_1]) ).
fof(f_28_2,plain,
? [U_45] :
( one_to_one(U_45)
& function(U_45)
& relation(U_45) ),
inference(variable_rename,[status(thm)],[f_28_1]) ).
fof(f_28_3,plain,
( one_to_one(sK9)
& function(sK9)
& relation(sK9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_45,sK9)],[f_28_2]) ).
cnf(f_28_4,plain,
relation(sK9),
inference(clausify,[status(thm)],[f_28_3]) ).
cnf(f_28_5,plain,
function(sK9),
inference(clausify,[status(thm)],[f_28_3]) ).
cnf(f_28_6,plain,
one_to_one(sK9),
inference(clausify,[status(thm)],[f_28_3]) ).
fof(f_29_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_29_2,plain,
! [U_47,U_46] : subset(U_47,U_47),
inference(variable_rename,[status(thm)],[f_29_1]) ).
fof(f_29_3,plain,
! [U_47] : subset(U_47,U_47),
inference(miniscope,[status(thm)],[f_29_2]) ).
cnf(f_29_4,plain,
subset(U_47,U_47),
inference(clausify,[status(thm)],[f_29_3]) ).
fof(f_30_1,plain,
! [A,B,C] :
( ( ( in(A,relation_restriction(C,B))
| ~ in(A,cartesian_product2(B,B))
| ~ in(A,C) )
& ( ( in(A,cartesian_product2(B,B))
& in(A,C) )
| ~ in(A,relation_restriction(C,B)) ) )
| ~ relation(C) ),
inference(fof_nnf,[status(thm)],[t16_wellord1]) ).
fof(f_30_2,plain,
! [U_50,U_49,U_48] :
( ( ( in(U_50,relation_restriction(U_48,U_49))
| ~ in(U_50,cartesian_product2(U_49,U_49))
| ~ in(U_50,U_48) )
& ( ( in(U_50,cartesian_product2(U_49,U_49))
& in(U_50,U_48) )
| ~ in(U_50,relation_restriction(U_48,U_49)) ) )
| ~ relation(U_48) ),
inference(variable_rename,[status(thm)],[f_30_1]) ).
cnf(f_30_3,plain,
( in(U_50,U_48)
| ~ in(U_50,relation_restriction(U_48,U_49))
| ~ relation(U_48) ),
inference(clausify,[status(thm)],[f_30_2]) ).
cnf(f_30_4,plain,
( in(U_50,cartesian_product2(U_49,U_49))
| ~ in(U_50,relation_restriction(U_48,U_49))
| ~ relation(U_48) ),
inference(clausify,[status(thm)],[f_30_2]) ).
cnf(f_30_5,plain,
( in(U_50,relation_restriction(U_48,U_49))
| ~ in(U_50,cartesian_product2(U_49,U_49))
| ~ in(U_50,U_48)
| ~ relation(U_48) ),
inference(clausify,[status(thm)],[f_30_2]) ).
fof(f_31_1,plain,
! [A,B] :
( element(A,B)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[t1_subset]) ).
fof(f_31_2,plain,
! [U_52,U_51] :
( element(U_52,U_51)
| ~ in(U_52,U_51) ),
inference(variable_rename,[status(thm)],[f_31_1]) ).
cnf(f_31_3,plain,
( element(U_52,U_51)
| ~ in(U_52,U_51) ),
inference(clausify,[status(thm)],[f_31_2]) ).
fof(f_32_1,negated_conjecture,
~ ! [A,B,C] :
( relation(C)
=> subset(fiber(relation_restriction(C,A),B),fiber(C,B)) ),
inference(negate,[status(cth)],[t21_wellord1]) ).
fof(f_32_2,negated_conjecture,
? [A,B,C] :
( ~ subset(fiber(relation_restriction(C,A),B),fiber(C,B))
& relation(C) ),
inference(fof_nnf,[status(thm)],[f_32_1]) ).
fof(f_32_3,negated_conjecture,
? [U_55,U_54,U_53] :
( ~ subset(fiber(relation_restriction(U_53,U_55),U_54),fiber(U_53,U_54))
& relation(U_53) ),
inference(variable_rename,[status(thm)],[f_32_2]) ).
fof(f_32_4,negated_conjecture,
? [U_54,U_53] :
( ~ subset(fiber(relation_restriction(U_53,sK10),U_54),fiber(U_53,U_54))
& relation(U_53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(U_55,sK10)],[f_32_3]) ).
fof(f_32_5,negated_conjecture,
? [U_53] :
( ~ subset(fiber(relation_restriction(U_53,sK10),sK11),fiber(U_53,sK11))
& relation(U_53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(U_54,sK11)],[f_32_4]) ).
fof(f_32_6,negated_conjecture,
( ~ subset(fiber(relation_restriction(sK12,sK10),sK11),fiber(sK12,sK11))
& relation(sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(U_53,sK12)],[f_32_5]) ).
cnf(f_32_7,negated_conjecture,
relation(sK12),
inference(clausify,[status(thm)],[f_32_6]) ).
cnf(f_32_8,negated_conjecture,
~ subset(fiber(relation_restriction(sK12,sK10),sK11),fiber(sK12,sK11)),
inference(clausify,[status(thm)],[f_32_6]) ).
fof(f_33_1,plain,
! [A] : set_intersection2(A,empty_set) = empty_set,
inference(fof_nnf,[status(thm)],[t2_boole]) ).
fof(f_33_2,plain,
! [U_56] : set_intersection2(U_56,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[f_33_1]) ).
cnf(f_33_3,plain,
set_intersection2(U_56,empty_set) = empty_set,
inference(clausify,[status(thm)],[f_33_2]) ).
fof(f_34_1,plain,
! [A,B] :
( in(A,B)
| empty(B)
| ~ element(A,B) ),
inference(fof_nnf,[status(thm)],[t2_subset]) ).
fof(f_34_2,plain,
! [U_58,U_57] :
( in(U_58,U_57)
| empty(U_57)
| ~ element(U_58,U_57) ),
inference(variable_rename,[status(thm)],[f_34_1]) ).
cnf(f_34_3,plain,
( in(U_58,U_57)
| empty(U_57)
| ~ element(U_58,U_57) ),
inference(clausify,[status(thm)],[f_34_2]) ).
fof(f_35_1,plain,
! [A,B] :
( ( element(A,powerset(B))
| ~ subset(A,B) )
& ( subset(A,B)
| ~ element(A,powerset(B)) ) ),
inference(fof_nnf,[status(thm)],[t3_subset]) ).
fof(f_35_2,plain,
! [U_60,U_59] :
( ( element(U_60,powerset(U_59))
| ~ subset(U_60,U_59) )
& ( subset(U_60,U_59)
| ~ element(U_60,powerset(U_59)) ) ),
inference(variable_rename,[status(thm)],[f_35_1]) ).
fof(f_35_3,plain,
( ! [U_64,U_62] :
( element(U_64,powerset(U_62))
| ~ subset(U_64,U_62) )
& ! [U_63,U_61] :
( subset(U_63,U_61)
| ~ element(U_63,powerset(U_61)) ) ),
inference(miniscope,[status(thm)],[f_35_2]) ).
cnf(f_35_4,plain,
( subset(U_63,U_61)
| ~ element(U_63,powerset(U_61)) ),
inference(clausify,[status(thm)],[f_35_3]) ).
cnf(f_35_5,plain,
( element(U_64,powerset(U_62))
| ~ subset(U_64,U_62) ),
inference(clausify,[status(thm)],[f_35_3]) ).
fof(f_36_1,plain,
! [A,B,C] :
( element(A,C)
| ~ element(B,powerset(C))
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[t4_subset]) ).
fof(f_36_2,plain,
! [U_67,U_66,U_65] :
( element(U_67,U_65)
| ~ element(U_66,powerset(U_65))
| ~ in(U_67,U_66) ),
inference(variable_rename,[status(thm)],[f_36_1]) ).
cnf(f_36_3,plain,
( element(U_67,U_65)
| ~ element(U_66,powerset(U_65))
| ~ in(U_67,U_66) ),
inference(clausify,[status(thm)],[f_36_2]) ).
fof(f_37_1,plain,
! [A,B,C] :
( ~ empty(C)
| ~ element(B,powerset(C))
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[t5_subset]) ).
fof(f_37_2,plain,
! [U_70,U_69,U_68] :
( ~ empty(U_68)
| ~ element(U_69,powerset(U_68))
| ~ in(U_70,U_69) ),
inference(variable_rename,[status(thm)],[f_37_1]) ).
fof(f_37_3,plain,
! [U_70,U_69] :
( ! [U_68] :
( ~ empty(U_68)
| ~ element(U_69,powerset(U_68)) )
| ~ in(U_70,U_69) ),
inference(miniscope,[status(thm)],[f_37_2]) ).
cnf(f_37_4,plain,
( ~ empty(U_68)
| ~ element(U_69,powerset(U_68))
| ~ in(U_70,U_69) ),
inference(clausify,[status(thm)],[f_37_3]) ).
fof(f_38_1,plain,
! [A] :
( A = empty_set
| ~ empty(A) ),
inference(fof_nnf,[status(thm)],[t6_boole]) ).
fof(f_38_2,plain,
! [U_71] :
( U_71 = empty_set
| ~ empty(U_71) ),
inference(variable_rename,[status(thm)],[f_38_1]) ).
cnf(f_38_3,plain,
( U_71 = empty_set
| ~ empty(U_71) ),
inference(clausify,[status(thm)],[f_38_2]) ).
fof(f_39_1,plain,
! [A,B] :
( ~ empty(B)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[t7_boole]) ).
fof(f_39_2,plain,
! [U_73,U_72] :
( ~ empty(U_72)
| ~ in(U_73,U_72) ),
inference(variable_rename,[status(thm)],[f_39_1]) ).
cnf(f_39_3,plain,
( ~ empty(U_72)
| ~ in(U_73,U_72) ),
inference(clausify,[status(thm)],[f_39_2]) ).
fof(f_40_1,plain,
! [A,B] :
( ~ empty(B)
| A = B
| ~ empty(A) ),
inference(fof_nnf,[status(thm)],[t8_boole]) ).
fof(f_40_2,plain,
! [U_75,U_74] :
( ~ empty(U_74)
| U_75 = U_74
| ~ empty(U_75) ),
inference(variable_rename,[status(thm)],[f_40_1]) ).
fof(f_40_3,plain,
! [U_75] :
( ! [U_74] :
( ~ empty(U_74)
| U_75 = U_74 )
| ~ empty(U_75) ),
inference(miniscope,[status(thm)],[f_40_2]) ).
cnf(f_40_4,plain,
( ~ empty(U_74)
| U_75 = U_74
| ~ empty(U_75) ),
inference(clausify,[status(thm)],[f_40_3]) ).
cnf(f_3_3_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_3_3]) ).
cnf(f_3_4_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_3_4]) ).
cnf(f_10_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_10_2]) ).
cnf(f_11_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_11_2]) ).
cnf(f_12_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_12_2]) ).
cnf(f_13_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_13_2]) ).
cnf(f_14_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_14_2]) ).
cnf(f_16_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_16_2]) ).
cnf(f_17_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_17_2]) ).
cnf(f_18_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_18_2]) ).
cnf(f_19_2_true,plain,
$true,
inference(clause_is_true,[status(thm)],[f_19_2]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( unordered_pair(Eq_x_0,Eq_x_1) = unordered_pair(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( set_intersection2(Eq_x_0,Eq_x_1) = set_intersection2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( fiber(Eq_x_0,Eq_x_1) = fiber(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( ordered_pair(Eq_x_0,Eq_x_1) = ordered_pair(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( singleton(Eq_x_0) = singleton(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_9,axiom,
( relation_restriction(Eq_x_0,Eq_x_1) = relation_restriction(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_10,axiom,
( cartesian_product2(Eq_x_0,Eq_x_1) = cartesian_product2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_11,axiom,
( powerset(Eq_x_0) = powerset(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_12,axiom,
( sK1(Eq_x_0,Eq_x_1,Eq_x_2) = sK1(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_13,axiom,
( sK2(Eq_x_0,Eq_x_1,Eq_x_2) = sK2(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_14,axiom,
( sK3(Eq_x_0,Eq_x_1) = sK3(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_15,axiom,
( sK4(Eq_x_0) = sK4(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_16,axiom,
( in(Eq_y_0,Eq_y_1)
| ~ in(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_17,axiom,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_18,axiom,
( function(Eq_y_0)
| ~ function(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_19,axiom,
( relation(Eq_y_0)
| ~ relation(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_20,axiom,
( one_to_one(Eq_y_0)
| ~ one_to_one(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_21,axiom,
( subset(Eq_y_0,Eq_y_1)
| ~ subset(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_22,axiom,
( element(Eq_y_0,Eq_y_1)
| ~ element(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU251+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 19 23:45:35 UTC 2026
% 0.09/0.37 % CPUTime :
% 232.15/232.47 % SZS status Theorem for theBenchmark
% 232.15/232.47 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------