%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MSC011+1 : TPTP v9.3.1. Released v3.2.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 : 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 08:50:56 AM UTC 2026
% Result : Theorem 0.14s 0.37s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 13 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 19 ~; 15 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 13 ( 1 sgn 8 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d_cons,axiom,
! [A] :
( ( not_drunk(A)
& drunk(A) )
=> goal ),
file('theBenchmark.p',d_cons) ).
fof(neg_phi,axiom,
! [A] :
( neg_psi
& drunk(A) ),
file('theBenchmark.p',neg_phi) ).
fof(neg_psi_ax,axiom,
( neg_psi
=> ? [A] : not_drunk(A) ),
file('theBenchmark.p',neg_psi_ax) ).
fof(goal_to_be_proved,conjecture,
goal,
file('theBenchmark.p',goal_to_be_proved) ).
fof(f_1_1,plain,
! [A] :
( goal
| ~ not_drunk(A)
| ~ drunk(A) ),
inference(fof_nnf,[status(thm)],[d_cons]) ).
fof(f_1_2,plain,
! [U_0] :
( goal
| ~ not_drunk(U_0)
| ~ drunk(U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_0] :
( ~ not_drunk(U_0)
| ~ drunk(U_0) )
| goal ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ not_drunk(U_0)
| ~ drunk(U_0)
| goal ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [A] :
( neg_psi
& drunk(A) ),
inference(fof_nnf,[status(thm)],[neg_phi]) ).
fof(f_2_2,plain,
! [U_1] :
( neg_psi
& drunk(U_1) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ! [U_1] : drunk(U_1)
& neg_psi ),
inference(miniscope,[status(thm)],[f_2_2]) ).
cnf(f_2_4,plain,
neg_psi,
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_5,plain,
drunk(U_1),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
( ? [A] : not_drunk(A)
| ~ neg_psi ),
inference(fof_nnf,[status(thm)],[neg_psi_ax]) ).
fof(f_3_2,plain,
( ? [U_2] : not_drunk(U_2)
| ~ neg_psi ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( not_drunk(sK1)
| ~ neg_psi ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1)],[f_3_2]) ).
cnf(f_3_4,plain,
( not_drunk(sK1)
| ~ neg_psi ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,negated_conjecture,
~ goal,
inference(negate,[status(cth)],[goal_to_be_proved]) ).
fof(f_4_2,negated_conjecture,
~ goal,
inference(definitional_conversion,[status(esa)],[f_4_1]) ).
cnf(f_4_3,negated_conjecture,
~ goal,
inference(clausify,[status(thm)],[f_4_2]) ).
cnf(t1,plain,
~ goal,
inference(start,[status(thm),parent(0:0)],[f_4_3]) ).
cnf(t2,plain,
( ~ drunk(sK1)
| ~ not_drunk(sK1)
| goal ),
inference(extension,[status(thm),parent(t1:1)],[f_1_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ neg_psi
| not_drunk(sK1) ),
inference(extension,[status(thm),parent(t2:2)],[f_3_4]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
neg_psi,
inference(extension,[status(thm),parent(t4:2)],[f_2_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
drunk(sK1),
inference(extension,[status(thm),parent(t2:3)],[f_2_5]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MSC011+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a FOF_THM_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.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 19 16:17:39 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------