%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : KRS067+1 : TPTP v9.3.1. Released v3.1.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 : n006.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:47:12 AM UTC 2026
% Result : Unsatisfiable 0.14s 5.41s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ),
file('theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X] :
( xsd_string(X)
<=> ~ xsd_integer(X) ),
file('theBenchmark.p',axiom_1) ).
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> ( ( ca(X)
& cc(X) )
| ( ca(X)
& cb(X) )
| ( cb(X)
& cc(X) ) ) ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X] :
( ca(X)
=> ~ ( cb(X)
| cc(X) ) ),
file('theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X] :
( cb(X)
=> ~ cc(X) ),
file('theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('theBenchmark.p',axiom_5) ).
fof(f_1_1,plain,
! [X] :
( ~ cowlNothing(X)
& cowlThing(X) ),
inference(fof_nnf,[status(thm)],[axiom_0]) ).
fof(f_1_2,plain,
! [U_0] :
( ~ cowlNothing(U_0)
& cowlThing(U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_2] : ~ cowlNothing(U_2)
& ! [U_1] : cowlThing(U_1) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,plain,
( ! [U_2] : ~ cowlNothing(U_2)
& ! [U_1] : cowlThing(U_1) ),
inference(definitional_conversion,[status(esa)],[f_1_3]) ).
cnf(f_1_5,plain,
cowlThing(U_1),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_6,plain,
~ cowlNothing(U_2),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_2_1,plain,
! [X] :
( ( xsd_string(X)
| xsd_integer(X) )
& ( ~ xsd_integer(X)
| ~ xsd_string(X) ) ),
inference(fof_nnf,[status(thm)],[axiom_1]) ).
fof(f_2_2,plain,
! [U_3] :
( ( xsd_string(U_3)
| xsd_integer(U_3) )
& ( ~ xsd_integer(U_3)
| ~ xsd_string(U_3) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_5] :
( xsd_string(U_5)
| xsd_integer(U_5) )
& ! [U_4] :
( ~ xsd_integer(U_4)
| ~ xsd_string(U_4) ) ),
inference(miniscope,[status(thm)],[f_2_2]) ).
fof(f_2_4,plain,
( ! [U_5] :
( xsd_string(U_5)
| xsd_integer(U_5) )
& ! [U_4] :
( ~ xsd_integer(U_4)
| ~ xsd_string(U_4) ) ),
inference(definitional_conversion,[status(esa)],[f_2_3]) ).
cnf(f_2_5,plain,
( ~ xsd_integer(U_4)
| ~ xsd_string(U_4) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(f_2_6,plain,
( xsd_string(U_5)
| xsd_integer(U_5) ),
inference(clausify,[status(thm)],[f_2_4]) ).
fof(f_3_1,plain,
! [X] :
( ( cUnsatisfiable(X)
| ( ( ~ ca(X)
| ~ cc(X) )
& ( ~ ca(X)
| ~ cb(X) )
& ( ~ cb(X)
| ~ cc(X) ) ) )
& ( ( ca(X)
& cc(X) )
| ( ca(X)
& cb(X) )
| ( cb(X)
& cc(X) )
| ~ cUnsatisfiable(X) ) ),
inference(fof_nnf,[status(thm)],[axiom_2]) ).
fof(f_3_2,plain,
! [U_6] :
( ( cUnsatisfiable(U_6)
| ( ( ~ ca(U_6)
| ~ cc(U_6) )
& ( ~ ca(U_6)
| ~ cb(U_6) )
& ( ~ cb(U_6)
| ~ cc(U_6) ) ) )
& ( ( ca(U_6)
& cc(U_6) )
| ( ca(U_6)
& cb(U_6) )
| ( cb(U_6)
& cc(U_6) )
| ~ cUnsatisfiable(U_6) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_8] :
( cUnsatisfiable(U_8)
| ( ( ~ ca(U_8)
| ~ cc(U_8) )
& ( ~ ca(U_8)
| ~ cb(U_8) )
& ( ~ cb(U_8)
| ~ cc(U_8) ) ) )
& ! [U_7] :
( ( ca(U_7)
& cc(U_7) )
| ( ca(U_7)
& cb(U_7) )
| ( cb(U_7)
& cc(U_7) )
| ~ cUnsatisfiable(U_7) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
fof(f_3_4,plain,
( ! [U_8] :
( ~ ca(U_8)
| ~ cc(U_8)
| ~ sP3(U_8) )
& ! [U_8] :
( ~ ca(U_8)
| ~ cb(U_8)
| ~ sP3(U_8) )
& ! [U_8] :
( ~ cb(U_8)
| ~ cc(U_8)
| ~ sP3(U_8) )
& ! [U_7] :
( ca(U_7)
| ~ sP2(U_7) )
& ! [U_7] :
( cc(U_7)
| ~ sP2(U_7) )
& ! [U_7] :
( ca(U_7)
| ~ sP1(U_7) )
& ! [U_7] :
( cb(U_7)
| ~ sP1(U_7) )
& ! [U_7] :
( cb(U_7)
| ~ sP0(U_7) )
& ! [U_7] :
( cc(U_7)
| ~ sP0(U_7) )
& ! [U_8] :
( cUnsatisfiable(U_8)
| sP3(U_8) )
& ! [U_7] :
( sP2(U_7)
| sP1(U_7)
| sP0(U_7)
| ~ cUnsatisfiable(U_7) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3])],[f_3_3]) ).
cnf(f_3_5,plain,
( sP2(U_7)
| sP1(U_7)
| sP0(U_7)
| ~ cUnsatisfiable(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_6,plain,
( cUnsatisfiable(U_8)
| sP3(U_8) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_7,plain,
( cc(U_7)
| ~ sP0(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_8,plain,
( cb(U_7)
| ~ sP0(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_9,plain,
( cb(U_7)
| ~ sP1(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_10,plain,
( ca(U_7)
| ~ sP1(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_11,plain,
( cc(U_7)
| ~ sP2(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_12,plain,
( ca(U_7)
| ~ sP2(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_13,plain,
( ~ cb(U_8)
| ~ cc(U_8)
| ~ sP3(U_8) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_14,plain,
( ~ ca(U_8)
| ~ cb(U_8)
| ~ sP3(U_8) ),
inference(clausify,[status(thm)],[f_3_4]) ).
cnf(f_3_15,plain,
( ~ ca(U_8)
| ~ cc(U_8)
| ~ sP3(U_8) ),
inference(clausify,[status(thm)],[f_3_4]) ).
fof(f_4_1,plain,
! [X] :
( ( ~ cb(X)
& ~ cc(X) )
| ~ ca(X) ),
inference(fof_nnf,[status(thm)],[axiom_3]) ).
fof(f_4_2,plain,
! [U_9] :
( ( ~ cb(U_9)
& ~ cc(U_9) )
| ~ ca(U_9) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_9] :
( ~ cb(U_9)
| ~ sP4(U_9) )
& ! [U_9] :
( ~ cc(U_9)
| ~ sP4(U_9) )
& ! [U_9] :
( sP4(U_9)
| ~ ca(U_9) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP4])],[f_4_2]) ).
cnf(f_4_4,plain,
( sP4(U_9)
| ~ ca(U_9) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_5,plain,
( ~ cc(U_9)
| ~ sP4(U_9) ),
inference(clausify,[status(thm)],[f_4_3]) ).
cnf(f_4_6,plain,
( ~ cb(U_9)
| ~ sP4(U_9) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
! [X] :
( ~ cc(X)
| ~ cb(X) ),
inference(fof_nnf,[status(thm)],[axiom_4]) ).
fof(f_5_2,plain,
! [U_10] :
( ~ cc(U_10)
| ~ cb(U_10) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
! [U_10] :
( ~ cc(U_10)
| ~ cb(U_10) ),
inference(definitional_conversion,[status(esa)],[f_5_2]) ).
cnf(f_5_4,plain,
( ~ cc(U_10)
| ~ cb(U_10) ),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(fof_nnf,[status(thm)],[axiom_5]) ).
fof(f_6_2,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(definitional_conversion,[status(esa)],[f_6_1]) ).
cnf(f_6_3,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(clausify,[status(thm)],[f_6_2]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS067+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 This is a FOF_UNS_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/5.37 % Computer : n006.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sat Sep 19 12:11:19 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.14/5.41 % SZS status Unsatisfiable for theBenchmark
% 0.14/5.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------