%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT049+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:02:58 AM UTC 2026
% Result : Theorem 0.09s 5.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 32 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 26 ( 9 ~; 4 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 27 ( 6 sgn 12 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(assumption_6,axiom,
! [X,T0,T] :
( organization(X)
=> ( ( external_ties(X,T) = external_ties(X,T0)
=> position(X,T) = position(X,T0) )
& ( greater(external_ties(X,T),external_ties(X,T0))
=> greater(position(X,T),position(X,T0)) ) ) ),
file('theBenchmark.p',assumption_6) ).
fof(assumption_11,axiom,
! [X,T0,T] :
( organization(X)
=> external_ties(X,T) = external_ties(X,T0) ),
file('theBenchmark.p',assumption_11) ).
fof(lemma_6,conjecture,
! [X,T0,T] :
( ( greater(age(X,T),age(X,T0))
& organization(X) )
=> position(X,T) = position(X,T0) ),
file('theBenchmark.p',lemma_6) ).
fof(lemma_6_neg,negated_conjecture,
~ ! [X,T0,T] :
( ( greater(age(X,T),age(X,T0))
& organization(X) )
=> position(X,T) = position(X,T0) ),
inference(assume_negation,[status(cth)],[lemma_6]) ).
cnf(c_19,plain,
( external_ties(A,B) = external_ties(A,C)
| ~ organization(A) ),
inference(clausify,[status(thm)],[assumption_11]) ).
fof(nnf_9,plain,
? [X,T0,T] :
( position(X,T0) != position(X,T)
& greater(age(X,T),age(X,T0))
& organization(X) ),
inference(fof_nnf,[status(thm)],[lemma_6_neg]) ).
fof(sk_lemma_6_neg,plain,
( position(sK0,sK1) != position(sK0,sK2)
& greater(age(sK0,sK2),age(sK0,sK1))
& organization(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK2,sK1]),skolemize(X,sK0),skolemize(T0,sK1),skolemize(T,sK2)],[nnf_9]) ).
cnf(c_20,negated_conjecture,
organization(sK0),
inference(split_conjunct,[status(thm)],[sk_lemma_6_neg]) ).
cnf(c_21,plain,
( position(A,B) = position(A,C)
| external_ties(A,B) != external_ties(A,C)
| ~ organization(A) ),
inference(clausify,[status(thm)],[assumption_6]) ).
cnf(c_24,negated_conjecture,
( position(sK0,A) = position(sK0,B)
| external_ties(sK0,A) != external_ties(sK0,B) ),
inference(resolve,[status(thm)],[c_21,c_20]) ).
cnf(c_25,negated_conjecture,
external_ties(sK0,A) = external_ties(sK0,B),
inference(resolve,[status(thm)],[c_19,c_20]) ).
cnf(c_30,negated_conjecture,
position(sK0,sK1) != position(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_lemma_6_neg]) ).
cnf(c_31,negated_conjecture,
position(sK0,sK2) != position(sK0,sK1),
inference(copy,[status(thm)],[c_30]) ).
cnf(c_32,negated_conjecture,
position(sK0,A) = position(sK0,B),
inference(resolve,[status(thm)],[c_25,c_24]) ).
cnf(c_33,plain,
$false,
inference(resolve,[status(thm)],[c_32,c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT049+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.35 % Computer : n017.cluster.edu
% 0.09/5.35 % Model : x86_64 x86_64
% 0.09/5.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.35 % Memory : 8046.5625MB
% 0.09/5.35 % OS : Linux 6.8.0-71-generic
% 0.09/5.35 % CPULimit : 300
% 0.09/5.35 % WCLimit : 300
% 0.09/5.35 % DateTime : Sat Sep 26 00:04:53 UTC 2026
% 0.09/5.35 % CPUTime :
% 0.09/5.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.36 % Process 3524286 was started by sandbox on n017,
% 0.09/5.36 % Sat Sep 26 00:04:53 2026
% 0.09/5.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/5.36
% 0.09/5.36 % From the command line: assign(max_seconds, 300).
% 0.09/5.37
% 0.09/5.37 % SZS status Theorem for theBenchmark
% 0.09/5.37
% 0.09/5.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/5.37 % Length of proof is 12.
% 0.09/5.37 % Level of proof is 4.
% 0.09/5.37 % Maximum clause weight is 14.000.
% 0.09/5.37 % Given clauses 0.
% 0.09/5.37
% 0.09/5.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------