%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT116+1 : TPTP v9.3.1. Released v9.3.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 : n015.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:54 AM UTC 2026
% Result : Theorem 0.08s 0.39s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 26 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 48 ( 24 ~; 20 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 30 ( 3 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax_B3,axiom,
! [S,A,T,Rho,E,R] :
( ( founds_rem(E,Rho,R)
& part_of(S,Rho)
& cnt(S,decl(A),T)
& subjection(S) )
=> about_event(S,E) ),
file('theBenchmark.p',ax_B3) ).
fof(subj_s,axiom,
subjection(s),
file('theBenchmark.p',subj_s) ).
fof(cnt_s,axiom,
cnt(s,decl(some_action),some_target),
file('theBenchmark.p',cnt_s) ).
fof(partof_s,axiom,
part_of(s,rho_r),
file('theBenchmark.p',partof_s) ).
fof(founds_rem1,axiom,
founds_rem(e1,rho_r,f1),
file('theBenchmark.p',founds_rem1) ).
fof(conjecture,conjecture,
about_event(s,e1),
file('theBenchmark.p',conjecture) ).
fof(f_1_1,plain,
! [S,A,T,Rho,E,R] :
( about_event(S,E)
| ~ founds_rem(E,Rho,R)
| ~ part_of(S,Rho)
| ~ cnt(S,decl(A),T)
| ~ subjection(S) ),
inference(fof_nnf,[status(thm)],[ax_B3]) ).
fof(f_1_2,plain,
! [U_5,U_4,U_3,U_2,U_1,U_0] :
( about_event(U_5,U_1)
| ~ founds_rem(U_1,U_2,U_0)
| ~ part_of(U_5,U_2)
| ~ cnt(U_5,decl(U_4),U_3)
| ~ subjection(U_5) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_5,U_4,U_3,U_2,U_1] :
( ! [U_0] : ~ founds_rem(U_1,U_2,U_0)
| ~ part_of(U_5,U_2)
| ~ cnt(U_5,decl(U_4),U_3)
| ~ subjection(U_5)
| about_event(U_5,U_1) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ founds_rem(U_1,U_2,U_0)
| ~ part_of(U_5,U_2)
| ~ cnt(U_5,decl(U_4),U_3)
| ~ subjection(U_5)
| about_event(U_5,U_1) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_8_1,plain,
subjection(s),
inference(fof_nnf,[status(thm)],[subj_s]) ).
cnf(f_8_2,plain,
subjection(s),
inference(clausify,[status(thm)],[f_8_1]) ).
fof(f_9_1,plain,
cnt(s,decl(some_action),some_target),
inference(fof_nnf,[status(thm)],[cnt_s]) ).
cnf(f_9_2,plain,
cnt(s,decl(some_action),some_target),
inference(clausify,[status(thm)],[f_9_1]) ).
fof(f_10_1,plain,
part_of(s,rho_r),
inference(fof_nnf,[status(thm)],[partof_s]) ).
cnf(f_10_2,plain,
part_of(s,rho_r),
inference(clausify,[status(thm)],[f_10_1]) ).
fof(f_11_1,plain,
founds_rem(e1,rho_r,f1),
inference(fof_nnf,[status(thm)],[founds_rem1]) ).
cnf(f_11_2,plain,
founds_rem(e1,rho_r,f1),
inference(clausify,[status(thm)],[f_11_1]) ).
fof(f_12_1,negated_conjecture,
~ about_event(s,e1),
inference(negate,[status(cth)],[conjecture]) ).
fof(f_12_2,negated_conjecture,
~ about_event(s,e1),
inference(definitional_conversion,[status(esa)],[f_12_1]) ).
cnf(f_12_3,negated_conjecture,
~ about_event(s,e1),
inference(clausify,[status(thm)],[f_12_2]) ).
cnf(t1,plain,
~ about_event(s,e1),
inference(start,[status(thm),parent(0:0)],[f_12_3]) ).
cnf(t2,plain,
( ~ subjection(s)
| ~ cnt(s,decl(some_action),some_target)
| ~ part_of(s,rho_r)
| ~ founds_rem(e1,rho_r,f1)
| about_event(s,e1) ),
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,
founds_rem(e1,rho_r,f1),
inference(extension,[status(thm),parent(t2:2)],[f_11_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
part_of(s,rho_r),
inference(extension,[status(thm),parent(t2:3)],[f_10_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
cnt(s,decl(some_action),some_target),
inference(extension,[status(thm),parent(t2:4)],[f_9_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
cnf(t10,plain,
subjection(s),
inference(extension,[status(thm),parent(t2:5)],[f_8_2]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT116+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03 This is a FOF_THM_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.08/0.36 % Computer : n015.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 19 16:25:04 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.39 % SZS status Theorem for theBenchmark
% 0.08/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------