%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MSC011+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 02:13:35 PM UTC 2026
% Result : Theorem 5.52s 1.62s
% Output : Proof 5.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 27 unt; 0 def)
% Number of atoms : 53 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 9 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 24 ( 9 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,axiom,
! [A] :
( ( not_drunk(A)
& drunk(A) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_cons) ).
fof(f0_nnf,plain,
! [A] :
( goal
| ~ not_drunk(A)
| ~ drunk(A) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A] :
( goal
| ~ not_drunk(A)
| ~ drunk(A) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( goal
| ~ not_drunk(X0)
| ~ drunk(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t5,plain,
ifeq(drunk(X1),true,ifeq(not_drunk(X1),true,goal,true),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t8,plain,
ifeq(drunk(X1),true,ifeq(not_drunk(X1),true,goal,true),true) = true,
inference(orient,[status(thm)],[t5]) ).
fof(f1,axiom,
! [A] :
( neg_psi
& drunk(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neg_phi) ).
fof(f1_nnf,plain,
! [A] :
( neg_psi
& drunk(A) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A] :
( neg_psi
& drunk(A) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
drunk(X0),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t1,plain,
drunk(X1) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t13,plain,
drunk(X1) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(t20,plain,
ifeq(true,true,ifeq(not_drunk(X1),true,goal,true),true) = true,
inference(step,[status(thm)],[t8,t13]) ).
cnf(t3,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t6,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t3]) ).
cnf(t21,plain,
ifeq(not_drunk(X1),true,goal,true) = true,
inference(step,[status(thm)],[t20,t6]) ).
cnf(t14,plain,
ifeq(not_drunk(X1),true,goal,true) = true,
inference(rw,[status(thm)],[t21]) ).
cnf(t15,plain,
ifeq(not_drunk(X1),true,goal,true) = true,
inference(orient,[status(thm)],[t14]) ).
fof(f2,axiom,
( neg_psi
=> ? [A] : not_drunk(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neg_psi_ax) ).
fof(f2_nnf,plain,
( ? [A] : not_drunk(A)
| ~ neg_psi ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
( not_drunk(sk0)
| ~ neg_psi ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f2_nnf]) ).
cnf(c3,plain,
( not_drunk(sk0)
| ~ neg_psi ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi3,axiom,
ifeq(neg_psi,true,not_drunk(sk0),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(c2,plain,
neg_psi,
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi2,axiom,
neg_psi = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t2,plain,
not_drunk(sk0) = true,
inference(hyper_resolution,[status(thm)],[hi3,hi2]) ).
cnf(t9,plain,
not_drunk(sk0) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t16,plain,
true = ifeq(true,true,goal,true),
inference(cp,[status(thm)],[t15,t9]) ).
cnf(t22,plain,
true = goal,
inference(step,[status(thm)],[t16,t6]) ).
cnf(t17,plain,
goal = true,
inference(orient,[status(thm)],[t22]) ).
fof(f3,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f3_neg,negated_conjecture,
~ goal,
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f3_nnf,plain,
~ goal,
inference(nnf_transformation,[status(thm)],[f3_neg]) ).
fof(f3_sk,plain,
~ goal,
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c4,plain,
~ goal,
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(goal_0,negated_conjecture,
true != goal,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t17]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC011+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/0.81 % Computer : n016.cluster.edu
% 0.14/0.81 % Model : x86_64 x86_64
% 0.14/0.81 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.81 % Memory : 8046.5625MB
% 0.14/0.81 % OS : Linux 6.8.0-71-generic
% 0.14/0.81 % CPULimit : 300
% 0.14/0.81 % WCLimit : 300
% 0.14/0.81 % DateTime : Thu Sep 24 01:32:43 UTC 2026
% 0.14/0.81 % CPUTime :
% 0.14/0.81 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.52/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.52/1.62 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------