%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MSC017+1 : TPTP v9.3.1. Released v4.0.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:50:57 AM UTC 2026
% Result : Theorem 0.15s 10.41s
% Output : Proof 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 63 ( 30 unt; 0 def)
% Number of atoms : 145 ( 15 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 143 ( 61 ~; 51 |; 20 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 37 ( 0 sgn 19 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(depth_and_time_and_nitrogen,axiom,
! [D] :
( dive(D)
=> ( ( greater(time(D),time_limit)
| greater(depth(D),depth_limit) )
<=> greater(nitrogen(D),nitrogen_limit) ) ),
file('theBenchmark.p',depth_and_time_and_nitrogen) ).
fof(too_much_nitrogen,axiom,
! [D] :
( dive(D)
=> ( greater(nitrogen(D),nitrogen_limit)
<=> outcome(D,dci) ) ),
file('theBenchmark.p',too_much_nitrogen) ).
fof(dci_is_the_only_bad_outcome,axiom,
! [D] :
( dive(D)
=> ! [O] :
( ( bad(O)
& outcome(D,O) )
=> O = dci ) ),
file('theBenchmark.p',dci_is_the_only_bad_outcome) ).
fof(no_deep_long,axiom,
! [D] :
( dive(D)
=> ( ~ greater(time(D),time_limit)
& ~ greater(depth(D),depth_limit) ) ),
file('theBenchmark.p',no_deep_long) ).
fof(no_bad,conjecture,
! [D] :
( dive(D)
=> ! [O] :
( outcome(D,O)
=> ~ bad(O) ) ),
file('theBenchmark.p',no_bad) ).
fof(f_2_1,plain,
! [D] :
( ( ( greater(time(D),time_limit)
| greater(depth(D),depth_limit)
| ~ greater(nitrogen(D),nitrogen_limit) )
& ( greater(nitrogen(D),nitrogen_limit)
| ( ~ greater(time(D),time_limit)
& ~ greater(depth(D),depth_limit) ) ) )
| ~ dive(D) ),
inference(fof_nnf,[status(thm)],[depth_and_time_and_nitrogen]) ).
fof(f_2_2,plain,
! [U_1] :
( ( ( greater(time(U_1),time_limit)
| greater(depth(U_1),depth_limit)
| ~ greater(nitrogen(U_1),nitrogen_limit) )
& ( greater(nitrogen(U_1),nitrogen_limit)
| ( ~ greater(time(U_1),time_limit)
& ~ greater(depth(U_1),depth_limit) ) ) )
| ~ dive(U_1) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_5,plain,
( greater(time(U_1),time_limit)
| greater(depth(U_1),depth_limit)
| ~ greater(nitrogen(U_1),nitrogen_limit)
| ~ dive(U_1) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [D] :
( ( ( greater(nitrogen(D),nitrogen_limit)
| ~ outcome(D,dci) )
& ( outcome(D,dci)
| ~ greater(nitrogen(D),nitrogen_limit) ) )
| ~ dive(D) ),
inference(fof_nnf,[status(thm)],[too_much_nitrogen]) ).
fof(f_3_2,plain,
! [U_2] :
( ( ( greater(nitrogen(U_2),nitrogen_limit)
| ~ outcome(U_2,dci) )
& ( outcome(U_2,dci)
| ~ greater(nitrogen(U_2),nitrogen_limit) ) )
| ~ dive(U_2) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_4,plain,
( greater(nitrogen(U_2),nitrogen_limit)
| ~ outcome(U_2,dci)
| ~ dive(U_2) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_5_1,plain,
! [D] :
( ! [O] :
( O = dci
| ~ bad(O)
| ~ outcome(D,O) )
| ~ dive(D) ),
inference(fof_nnf,[status(thm)],[dci_is_the_only_bad_outcome]) ).
fof(f_5_2,plain,
! [U_4] :
( ! [U_3] :
( U_3 = dci
| ~ bad(U_3)
| ~ outcome(U_4,U_3) )
| ~ dive(U_4) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
( U_3 = dci
| ~ bad(U_3)
| ~ outcome(U_4,U_3)
| ~ dive(U_4) ),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_1,plain,
! [D] :
( ( ~ greater(time(D),time_limit)
& ~ greater(depth(D),depth_limit) )
| ~ dive(D) ),
inference(fof_nnf,[status(thm)],[no_deep_long]) ).
fof(f_6_2,plain,
! [U_5] :
( ( ~ greater(time(U_5),time_limit)
& ~ greater(depth(U_5),depth_limit) )
| ~ dive(U_5) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
( ~ greater(depth(U_5),depth_limit)
| ~ dive(U_5) ),
inference(clausify,[status(thm)],[f_6_2]) ).
cnf(f_6_4,plain,
( ~ greater(time(U_5),time_limit)
| ~ dive(U_5) ),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_7_1,negated_conjecture,
~ ! [D] :
( dive(D)
=> ! [O] :
( outcome(D,O)
=> ~ bad(O) ) ),
inference(negate,[status(cth)],[no_bad]) ).
fof(f_7_2,negated_conjecture,
? [D] :
( ? [O] :
( bad(O)
& outcome(D,O) )
& dive(D) ),
inference(fof_nnf,[status(thm)],[f_7_1]) ).
fof(f_7_3,negated_conjecture,
? [U_7] :
( ? [U_6] :
( bad(U_6)
& outcome(U_7,U_6) )
& dive(U_7) ),
inference(variable_rename,[status(thm)],[f_7_2]) ).
fof(f_7_4,negated_conjecture,
( ? [U_6] :
( bad(U_6)
& outcome(sK1,U_6) )
& dive(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_7,sK1)],[f_7_3]) ).
fof(f_7_5,negated_conjecture,
( bad(sK2)
& outcome(sK1,sK2)
& dive(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_6,sK2)],[f_7_4]) ).
fof(f_7_6,negated_conjecture,
( bad(sK2)
& outcome(sK1,sK2)
& dive(sK1) ),
inference(definitional_conversion,[status(esa)],[f_7_5]) ).
cnf(f_7_7,negated_conjecture,
dive(sK1),
inference(clausify,[status(thm)],[f_7_6]) ).
cnf(f_7_8,negated_conjecture,
outcome(sK1,sK2),
inference(clausify,[status(thm)],[f_7_6]) ).
cnf(f_7_9,negated_conjecture,
bad(sK2),
inference(clausify,[status(thm)],[f_7_6]) ).
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_10,axiom,
( outcome(Eq_y_0,Eq_y_1)
| ~ outcome(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
( ~ greater(depth(sK1),depth_limit)
| ~ dive(sK1) ),
inference(start,[status(thm),parent(0:0)],[f_6_3]) ).
cnf(t2,plain,
dive(sK1),
inference(extension,[status(thm),parent(t1:1)],[f_7_7]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(l1,lemma,
dive(sK1),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t4,plain,
( ~ greater(nitrogen(sK1),nitrogen_limit)
| greater(time(sK1),time_limit)
| ~ dive(sK1)
| greater(depth(sK1),depth_limit) ),
inference(extension,[status(thm),parent(t1:2)],[f_2_5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
dive(sK1),
inference(lemma_extension,[status(thm),parent(t4:2)],[l1:1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ dive(sK1)
| ~ greater(time(sK1),time_limit) ),
inference(extension,[status(thm),parent(t4:3)],[f_6_4]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
dive(sK1),
inference(lemma_extension,[status(thm),parent(t8:2)],[l1:1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( ~ outcome(sK1,dci)
| ~ dive(sK1)
| greater(nitrogen(sK1),nitrogen_limit) ),
inference(extension,[status(thm),parent(t4:4)],[f_3_4]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t4:4]) ).
cnf(t14,plain,
dive(sK1),
inference(lemma_extension,[status(thm),parent(t12:2)],[l1:1]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
( sK2 != dci
| ~ outcome(sK1,sK2)
| sK1 != sK1
| outcome(sK1,dci) ),
inference(extension,[status(thm),parent(t12:3)],[equality_10]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
cnf(t18,plain,
( sK1 != sK1
| sK1 = sK1 ),
inference(extension,[status(thm),parent(t16:2)],[equality_2]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
sK1 = sK1,
inference(extension,[status(thm),parent(t18:2)],[equality_1]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
outcome(sK1,sK2),
inference(extension,[status(thm),parent(t16:3)],[f_7_8]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t16:3]) ).
cnf(l8,lemma,
outcome(sK1,sK2),
inference(lemma,[status(cth),parent(t16:3),below(t12:3)],[t16:3]) ).
cnf(t24,plain,
( ~ outcome(sK1,sK2)
| ~ bad(sK2)
| ~ dive(sK1)
| sK2 = dci ),
inference(extension,[status(thm),parent(t16:4)],[f_5_3]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t16:4]) ).
cnf(t26,plain,
dive(sK1),
inference(extension,[status(thm),parent(t24:2)],[f_7_7]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t24:2]) ).
cnf(t28,plain,
bad(sK2),
inference(extension,[status(thm),parent(t24:3)],[f_7_9]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t24:3]) ).
cnf(t30,plain,
outcome(sK1,sK2),
inference(lemma_extension,[status(thm),parent(t24:4)],[l8:1]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t24:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC017+1 : TPTP v9.3.1. Released v4.0.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/10.38 % Computer : n006.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Sat Sep 19 16:22:54 UTC 2026
% 0.09/10.39 % CPUTime :
% 0.15/10.41 % SZS status Theorem for theBenchmark
% 0.15/10.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------