%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : KRS094+1 : TPTP v9.3.1. Released v3.1.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 : n010.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:15 AM UTC 2026
% Result : Unsatisfiable 0.15s 10.42s
% Output : Proof 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 26 ~; 20 |; 4 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X] :
( cUnsatisfiable(X)
<=> cc1(X) ),
file('theBenchmark.p',axiom_2) ).
fof(axiom_4,axiom,
! [X] :
( cc1(X)
=> ~ cd1(X) ),
file('theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
! [X] :
( cc1(X)
=> cd1(X) ),
file('theBenchmark.p',axiom_5) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_20_11330),
file('theBenchmark.p',axiom_8) ).
fof(f_3_1,plain,
! [X] :
( ( cUnsatisfiable(X)
| ~ cc1(X) )
& ( cc1(X)
| ~ cUnsatisfiable(X) ) ),
inference(fof_nnf,[status(thm)],[axiom_2]) ).
fof(f_3_2,plain,
! [U_6] :
( ( cUnsatisfiable(U_6)
| ~ cc1(U_6) )
& ( cc1(U_6)
| ~ cUnsatisfiable(U_6) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_8] :
( cUnsatisfiable(U_8)
| ~ cc1(U_8) )
& ! [U_7] :
( cc1(U_7)
| ~ cUnsatisfiable(U_7) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
fof(f_3_4,plain,
( ! [U_8] :
( cUnsatisfiable(U_8)
| ~ cc1(U_8) )
& ! [U_7] :
( cc1(U_7)
| ~ cUnsatisfiable(U_7) ) ),
inference(definitional_conversion,[status(esa)],[f_3_3]) ).
cnf(f_3_5,plain,
( cc1(U_7)
| ~ cUnsatisfiable(U_7) ),
inference(clausify,[status(thm)],[f_3_4]) ).
fof(f_5_1,plain,
! [X] :
( ~ cd1(X)
| ~ cc1(X) ),
inference(fof_nnf,[status(thm)],[axiom_4]) ).
fof(f_5_2,plain,
! [U_10] :
( ~ cd1(U_10)
| ~ cc1(U_10) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
! [U_10] :
( ~ cd1(U_10)
| ~ cc1(U_10) ),
inference(definitional_conversion,[status(esa)],[f_5_2]) ).
cnf(f_5_4,plain,
( ~ cd1(U_10)
| ~ cc1(U_10) ),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
! [X] :
( cd1(X)
| ~ cc1(X) ),
inference(fof_nnf,[status(thm)],[axiom_5]) ).
fof(f_6_2,plain,
! [U_11] :
( cd1(U_11)
| ~ cc1(U_11) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
! [U_11] :
( cd1(U_11)
| ~ cc1(U_11) ),
inference(definitional_conversion,[status(esa)],[f_6_2]) ).
cnf(f_6_4,plain,
( cd1(U_11)
| ~ cc1(U_11) ),
inference(clausify,[status(thm)],[f_6_3]) ).
fof(f_9_1,plain,
cUnsatisfiable(i2003_11_14_17_20_11330),
inference(fof_nnf,[status(thm)],[axiom_8]) ).
fof(f_9_2,plain,
cUnsatisfiable(i2003_11_14_17_20_11330),
inference(definitional_conversion,[status(esa)],[f_9_1]) ).
cnf(f_9_3,plain,
cUnsatisfiable(i2003_11_14_17_20_11330),
inference(clausify,[status(thm)],[f_9_2]) ).
cnf(t1,plain,
( ~ cd1(i2003_11_14_17_20_11330)
| ~ cc1(i2003_11_14_17_20_11330) ),
inference(start,[status(thm),parent(0:0)],[f_5_4]) ).
cnf(t2,plain,
( ~ cUnsatisfiable(i2003_11_14_17_20_11330)
| cc1(i2003_11_14_17_20_11330) ),
inference(extension,[status(thm),parent(t1:1)],[f_3_5]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
cUnsatisfiable(i2003_11_14_17_20_11330),
inference(extension,[status(thm),parent(t2:2)],[f_9_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(l1,lemma,
cc1(i2003_11_14_17_20_11330),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t6,plain,
( ~ cc1(i2003_11_14_17_20_11330)
| cd1(i2003_11_14_17_20_11330) ),
inference(extension,[status(thm),parent(t1:2)],[f_6_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t1:2]) ).
cnf(t8,plain,
cc1(i2003_11_14_17_20_11330),
inference(lemma_extension,[status(thm),parent(t6:2)],[l1:1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS094+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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/10.39 % Computer : n010.cluster.edu
% 0.12/10.39 % Model : x86_64 x86_64
% 0.12/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39 % Memory : 8046.5625MB
% 0.12/10.39 % OS : Linux 6.8.0-71-generic
% 0.12/10.39 % CPULimit : 300
% 0.12/10.39 % WCLimit : 300
% 0.12/10.39 % DateTime : Sat Sep 19 12:12:41 UTC 2026
% 0.12/10.39 % CPUTime :
% 0.15/10.42 % SZS status Unsatisfiable for theBenchmark
% 0.15/10.42 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------