%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT049+1 : TPTP v9.2.1. Released v2.4.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 : n025.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:20 PM UTC 2026
% Result : Theorem 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 35 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 33 ( 12 ~; 9 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 6 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(assumption_6,axiom,
! [X1,X4,X5] :
( organization(X1)
=> ( ( greater(external_ties(X1,X5),external_ties(X1,X4))
=> greater(position(X1,X5),position(X1,X4)) )
& ( external_ties(X1,X5) = external_ties(X1,X4)
=> position(X1,X5) = position(X1,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6) ).
fof(assumption_11,axiom,
! [X1,X4,X5] :
( organization(X1)
=> external_ties(X1,X5) = external_ties(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_11) ).
fof(lemma_6,conjecture,
! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> position(X1,X5) = position(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_6) ).
fof(c_0_3,plain,
! [X41,X42,X43] :
( ( ~ greater(external_ties(X41,X43),external_ties(X41,X42))
| greater(position(X41,X43),position(X41,X42))
| ~ organization(X41) )
& ( external_ties(X41,X43) != external_ties(X41,X42)
| position(X41,X43) = position(X41,X42)
| ~ organization(X41) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_6])])]) ).
fof(c_0_4,plain,
! [X44,X45,X46] :
( ~ organization(X44)
| external_ties(X44,X46) = external_ties(X44,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[assumption_11])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X4,X5] :
( ( organization(X1)
& greater(age(X1,X5),age(X1,X4)) )
=> position(X1,X5) = position(X1,X4) ),
inference(assume_negation,[status(cth)],[lemma_6]) ).
cnf(c_0_6,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( organization(esk1_0)
& greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))
& position(esk1_0,esk3_0) != position(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1) ),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
organization(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
position(esk1_0,esk3_0) != position(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
position(esk1_0,X1) = position(esk1_0,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT049+1 : TPTP v9.2.1. Released v2.4.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.14/0.32 % Computer : n025.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 23:31:58 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Theorem for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.371s
%------------------------------------------------------------------------------