%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT116+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /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 : Sun Sep 27 08:03:09 AM UTC 2026
% Result : Theorem 0.17s 15.68s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 13 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 26 ( 12 ~; 10 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 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 : 22 ( 8 sgn 6 !; 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(conjecture,conjecture,
about_event(s,e1),
file('theBenchmark.p',conjecture) ).
fof(conjecture_neg,negated_conjecture,
~ about_event(s,e1),
inference(assume_negation,[status(cth)],[conjecture]) ).
cnf(c_3,plain,
( about_event(A,E)
| ~ founds_rem(E,D,F)
| ~ part_of(A,D)
| ~ cnt(A,decl(B),C)
| ~ subjection(A) ),
inference(clausify,[status(thm)],[ax_B3]) ).
fof(subj_s,axiom,
subjection(s),
file('theBenchmark.p',subj_s) ).
cnf(c_4,plain,
subjection(s),
inference(clausify,[status(thm)],[subj_s]) ).
fof(cnt_s,axiom,
cnt(s,decl(some_action),some_target),
file('theBenchmark.p',cnt_s) ).
cnf(c_5,plain,
cnt(s,decl(some_action),some_target),
inference(clausify,[status(thm)],[cnt_s]) ).
cnf(c_6,plain,
( about_event(s,D)
| ~ founds_rem(D,C,E)
| ~ part_of(s,C)
| ~ cnt(s,decl(A),B) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
fof(partof_s,axiom,
part_of(s,rho_r),
file('theBenchmark.p',partof_s) ).
cnf(c_7,plain,
part_of(s,rho_r),
inference(clausify,[status(thm)],[partof_s]) ).
cnf(c_8,plain,
( about_event(s,B)
| ~ founds_rem(B,A,C)
| ~ part_of(s,A) ),
inference(resolve,[status(thm)],[c_5,c_6]) ).
fof(founds_rem1,axiom,
founds_rem(e1,rho_r,f1),
file('theBenchmark.p',founds_rem1) ).
cnf(c_9,plain,
founds_rem(e1,rho_r,f1),
inference(clausify,[status(thm)],[founds_rem1]) ).
cnf(c_10,plain,
( about_event(s,A)
| ~ founds_rem(A,rho_r,B) ),
inference(resolve,[status(thm)],[c_7,c_8]) ).
cnf(c_11,negated_conjecture,
~ about_event(s,e1),
inference(clausify,[status(thm)],[conjecture_neg]) ).
cnf(c_12,plain,
about_event(s,e1),
inference(resolve,[status(thm)],[c_9,c_10]) ).
cnf(c_13,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_11,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT116+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/15.66 % Computer : n010.cluster.edu
% 0.17/15.66 % Model : x86_64 x86_64
% 0.17/15.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/15.66 % Memory : 8046.5625MB
% 0.17/15.66 % OS : Linux 6.8.0-71-generic
% 0.17/15.66 % CPULimit : 300
% 0.17/15.66 % WCLimit : 300
% 0.17/15.66 % DateTime : Sat Sep 26 00:14:47 UTC 2026
% 0.17/15.66 % CPUTime :
% 0.17/15.67 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/15.67 % Process 2007405 was started by sandbox2 on n010,
% 0.17/15.67 % Sat Sep 26 00:14:47 2026
% 0.17/15.67 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/15.67
% 0.17/15.67 % From the command line: assign(max_seconds, 300).
% 0.17/15.68
% 0.17/15.68 % SZS status Theorem for theBenchmark
% 0.17/15.68
% 0.17/15.68 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/15.68 % Length of proof is 13.
% 0.17/15.68 % Level of proof is 6.
% 0.17/15.68 % Maximum clause weight is 0.000.
% 0.17/15.68 % Given clauses 0.
% 0.17/15.68
% 0.17/15.68 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------