%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT116+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:48:30 PM UTC 2026
% Result : Theorem 0.24s 1.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 24 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 8 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 18 ( 3 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax_B3,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ( subjection(X1)
& cnt(X1,decl(X2),X3)
& part_of(X1,X4)
& founds_rem(X5,X4,X6) )
=> about_event(X1,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_B3) ).
fof(conjecture,conjecture,
about_event(s,e1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture) ).
fof(cnt_s,axiom,
cnt(s,decl(some_action),some_target),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cnt_s) ).
fof(founds_rem1,axiom,
founds_rem(e1,rho_r,f1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',founds_rem1) ).
fof(partof_s,axiom,
part_of(s,rho_r),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',partof_s) ).
fof(target_t,axiom,
target(some_target),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',target_t) ).
fof(action_a,axiom,
action(some_action),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',action_a) ).
fof(event_e1,axiom,
event(e1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',event_e1) ).
fof(rule_f1,axiom,
rule(f1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_f1) ).
fof(rel_rho_r,axiom,
legal_relator(rho_r),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rel_rho_r) ).
fof(pos_s,axiom,
position(s),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pos_s) ).
fof(subj_s,axiom,
subjection(s),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subj_s) ).
fof(i_0_12,plain,
! [X13,X14,X15,X16,X17,X18] :
( ~ subjection(X13)
| ~ cnt(X13,decl(X14),X15)
| ~ part_of(X13,X16)
| ~ founds_rem(X17,X16,X18)
| about_event(X13,X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_B3])]) ).
fof(i_0_13,negated_conjecture,
~ about_event(s,e1),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conjecture])]) ).
cnf(i_0_14,plain,
( about_event(X1,X5)
| ~ subjection(X1)
| ~ cnt(X1,decl(X2),X3)
| ~ part_of(X1,X4)
| ~ founds_rem(X5,X4,X6) ),
inference(split_conjunct,[status(thm)],[i_0_12]),
[final] ).
cnf(i_0_15,plain,
cnt(s,decl(some_action),some_target),
inference(split_conjunct,[status(thm)],[cnt_s]),
[final] ).
cnf(i_0_16,plain,
founds_rem(e1,rho_r,f1),
inference(split_conjunct,[status(thm)],[founds_rem1]),
[final] ).
cnf(i_0_17,negated_conjecture,
~ about_event(s,e1),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_18,plain,
part_of(s,rho_r),
inference(split_conjunct,[status(thm)],[partof_s]),
[final] ).
cnf(i_0_19,plain,
target(some_target),
inference(split_conjunct,[status(thm)],[target_t]),
[final] ).
cnf(i_0_20,plain,
action(some_action),
inference(split_conjunct,[status(thm)],[action_a]),
[final] ).
cnf(i_0_21,plain,
event(e1),
inference(split_conjunct,[status(thm)],[event_e1]),
[final] ).
cnf(i_0_22,plain,
rule(f1),
inference(split_conjunct,[status(thm)],[rule_f1]),
[final] ).
cnf(i_0_23,plain,
legal_relator(rho_r),
inference(split_conjunct,[status(thm)],[rel_rho_r]),
[final] ).
cnf(i_0_24,plain,
position(s),
inference(split_conjunct,[status(thm)],[pos_s]),
[final] ).
cnf(i_0_25,plain,
subjection(s),
inference(split_conjunct,[status(thm)],[subj_s]),
[final] ).
cnf(i_0_26,plain,
$false,
inference(scs_inference,[],[i_0_17,i_0_25,i_0_15,i_0_18,i_0_16,i_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT116+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32 % Computer : n009.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 23:34:41 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 0.24/1.61 % Version : CSE_E---1.7
% 0.24/1.61 % Problem : theBenchmark.p
% 0.24/1.61 % SZS status Theorem for theBenchmark.p
% 0.24/1.61 % SZS output start CNFRefutation
% See solution above
% 0.24/1.62 % Total time : 1.270s
%------------------------------------------------------------------------------