%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT048+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 : n013.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.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 59 ( 8 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 52 ( 17 ~; 14 |; 12 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 7 sgn 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(definition_smaller_or_equal,axiom,
! [X,Y] :
( smaller_or_equal(X,Y)
<=> ( X = Y
| smaller(X,Y) ) ),
file('theBenchmark.p',definition_smaller_or_equal) ).
fof(assumption_5,axiom,
! [X,T0,T] :
( organization(X)
=> ( ( ( internal_friction(X,T) = internal_friction(X,T0)
& stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) )
=> capability(X,T) = capability(X,T0) )
& ( ( greater(internal_friction(X,T),internal_friction(X,T0))
& smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) )
=> smaller(capability(X,T),capability(X,T0)) )
& ( ( smaller_or_equal(internal_friction(X,T),internal_friction(X,T0))
& greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) )
=> greater(capability(X,T),capability(X,T0)) ) ) ),
file('theBenchmark.p',assumption_5) ).
fof(assumption_10,axiom,
! [X,T0,T] :
( organization(X)
=> stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) ),
file('theBenchmark.p',assumption_10) ).
fof(assumption_12,axiom,
! [X,T0,T] :
( ( greater(age(X,T),age(X,T0))
& organization(X) )
=> greater(internal_friction(X,T),internal_friction(X,T0)) ),
file('theBenchmark.p',assumption_12) ).
fof(lemma_5,conjecture,
! [X,T0,T] :
( ( greater(age(X,T),age(X,T0))
& organization(X) )
=> smaller(capability(X,T),capability(X,T0)) ),
file('theBenchmark.p',lemma_5) ).
fof(lemma_5_neg,negated_conjecture,
~ ! [X,T0,T] :
( ( greater(age(X,T),age(X,T0))
& organization(X) )
=> smaller(capability(X,T),capability(X,T0)) ),
inference(assume_negation,[status(cth)],[lemma_5]) ).
cnf(c_14,plain,
( greater(internal_friction(A,B),internal_friction(A,C))
| ~ greater(age(A,B),age(A,C))
| ~ organization(A) ),
inference(clausify,[status(thm)],[assumption_12]) ).
fof(nnf_10,plain,
? [X,T0,T] :
( ~ smaller(capability(X,T),capability(X,T0))
& greater(age(X,T),age(X,T0))
& organization(X) ),
inference(fof_nnf,[status(thm)],[lemma_5_neg]) ).
fof(sk_lemma_5_neg,plain,
( ~ smaller(capability(sK0,sK1),capability(sK0,sK2))
& greater(age(sK0,sK1),age(sK0,sK2))
& organization(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(T0,sK2),skolemize(T,sK1)],[nnf_10]) ).
cnf(c_15,negated_conjecture,
organization(sK0),
inference(split_conjunct,[status(thm)],[sk_lemma_5_neg]) ).
cnf(c_16,plain,
( stock_of_knowledge(A,B) = stock_of_knowledge(A,C)
| ~ organization(A) ),
inference(clausify,[status(thm)],[assumption_10]) ).
cnf(c_18,plain,
( smaller(capability(A,B),capability(A,C))
| ~ greater(internal_friction(A,B),internal_friction(A,C))
| ~ smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C))
| ~ organization(A) ),
inference(clausify,[status(thm)],[assumption_5]) ).
cnf(c_21,negated_conjecture,
( smaller(capability(sK0,A),capability(sK0,B))
| ~ greater(internal_friction(sK0,A),internal_friction(sK0,B))
| ~ smaller_or_equal(stock_of_knowledge(sK0,A),stock_of_knowledge(sK0,B)) ),
inference(resolve,[status(thm)],[c_18,c_15]) ).
cnf(c_23,negated_conjecture,
stock_of_knowledge(sK0,A) = stock_of_knowledge(sK0,B),
inference(resolve,[status(thm)],[c_16,c_15]) ).
cnf(c_24,negated_conjecture,
( greater(internal_friction(sK0,A),internal_friction(sK0,B))
| ~ greater(age(sK0,A),age(sK0,B)) ),
inference(resolve,[status(thm)],[c_14,c_15]) ).
cnf(c_27,plain,
( B != A
| smaller_or_equal(A,B) ),
inference(clausify,[status(thm)],[definition_smaller_or_equal]) ).
cnf(c_33,negated_conjecture,
greater(age(sK0,sK1),age(sK0,sK2)),
inference(split_conjunct,[status(thm)],[sk_lemma_5_neg]) ).
cnf(c_34,negated_conjecture,
~ smaller(capability(sK0,sK1),capability(sK0,sK2)),
inference(split_conjunct,[status(thm)],[sk_lemma_5_neg]) ).
cnf(c_38,plain,
( smaller(capability(sK0,A),capability(sK0,C))
| ~ greater(internal_friction(sK0,A),internal_friction(sK0,C))
| ~ smaller_or_equal(stock_of_knowledge(sK0,A),stock_of_knowledge(sK0,B)) ),
inference(paramod,[status(thm)],[c_23,c_21]) ).
cnf(c_39,plain,
smaller_or_equal(stock_of_knowledge(sK0,A),stock_of_knowledge(sK0,B)),
inference(resolve,[status(thm)],[c_27,c_23]) ).
cnf(c_41,plain,
( smaller(capability(sK0,A),capability(sK0,B))
| ~ greater(internal_friction(sK0,A),internal_friction(sK0,B)) ),
inference(resolve,[status(thm)],[c_39,c_38]) ).
cnf(c_48,plain,
greater(internal_friction(sK0,sK1),internal_friction(sK0,sK2)),
inference(resolve,[status(thm)],[c_33,c_24]) ).
cnf(c_59,plain,
smaller(capability(sK0,sK1),capability(sK0,sK2)),
inference(resolve,[status(thm)],[c_41,c_48]) ).
cnf(c_58,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_34,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT048+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.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 00:08:21 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 1510803 was started by sandbox on n013,
% 0.08/0.36 % Sat Sep 26 00:08:21 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.38
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38
% 0.13/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.38 % Length of proof is 20.
% 0.13/0.38 % Level of proof is 5.
% 0.13/0.38 % Maximum clause weight is 21.000.
% 0.13/0.38 % Given clauses 26.
% 0.13/0.38
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------