%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT049-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n002.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 : Fri Sep 25 02:11:50 PM UTC 2026
% Result : Unsatisfiable 18.05s 8.24s
% Output : Proof 18.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 36 unt; 0 def)
% Number of atoms : 64 ( 44 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 26 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 74 ( 25 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f16,negated_conjecture,
position(sk1,sk3) != position(sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_6_35) ).
fof(f16_nnf,plain,
position(sk1,sk3) != position(sk1,sk2),
inference(nnf_transformation,[status(thm)],[f16]) ).
fof(f16_sk,plain,
position(sk1,sk3) != position(sk1,sk2),
inference(skolemisation,[status(esa)],[f16_nnf]) ).
cnf(c16,plain,
position(sk1,sk3) != position(sk1,sk2),
inference(cnf_transformation,[status(esa)],[f16_sk]) ).
cnf(t10,plain,
eq(position(sk1,sk3),position(sk1,sk2)) = false,
inference(equality_encoding,[status(esa)],[c16]) ).
cnf(t75,plain,
eq(position(sk1,sk3),position(sk1,sk2)) = false,
inference(orient,[status(thm)],[t10]) ).
cnf(t145,plain,
eq(position(sk1,sk3),position(sk1,sk2)) = false,
inference(rw,[status(thm)],[t75]) ).
cnf(f12,axiom,
( position(A,B) = position(A,C)
| external_ties(A,B) != external_ties(A,C)
| ~ organization(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_6_31) ).
fof(f12_nnf,plain,
! [A,B,C] :
( position(A,B) = position(A,C)
| external_ties(A,B) != external_ties(A,C)
| ~ organization(A) ),
inference(nnf_transformation,[status(thm)],[f12]) ).
fof(f12_sk,plain,
! [A,B,C] :
( position(A,B) = position(A,C)
| external_ties(A,B) != external_ties(A,C)
| ~ organization(A) ),
inference(skolemisation,[status(esa)],[f12_nnf]) ).
cnf(c12,plain,
( position(X0,X1) = position(X0,X2)
| external_ties(X0,X1) != external_ties(X0,X2)
| ~ organization(X0) ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(t27,plain,
ifeq(organization(X1),true,ifeq(external_ties(X1,X2),external_ties(X1,X3),position(X1,X2),position(X1,X3)),position(X1,X3)) = position(X1,X3),
inference(equality_encoding,[status(esa)],[c12]) ).
cnf(t70,plain,
ifeq(organization(X1),true,ifeq(external_ties(X1,X2),external_ties(X1,X3),position(X1,X2),position(X1,X3)),position(X1,X3)) = position(X1,X3),
inference(orient,[status(thm)],[t27]) ).
cnf(f13,axiom,
( external_ties(A,B) = external_ties(A,C)
| ~ organization(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_11_32) ).
fof(f13_nnf,plain,
! [A,B,C] :
( external_ties(A,B) = external_ties(A,C)
| ~ organization(A) ),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [A,B,C] :
( external_ties(A,B) = external_ties(A,C)
| ~ organization(A) ),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
( external_ties(X0,X1) = external_ties(X0,X2)
| ~ organization(X0) ),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(t22,plain,
ifeq(organization(X1),true,external_ties(X1,X2),external_ties(X1,X3)) = external_ties(X1,X3),
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(t73,plain,
ifeq(organization(X1),true,external_ties(X1,X2),external_ties(X1,X3)) = external_ties(X1,X3),
inference(orient,[status(thm)],[t22]) ).
cnf(f14,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_6_33) ).
fof(f14_nnf,plain,
organization(sk1),
inference(nnf_transformation,[status(thm)],[f14]) ).
cnf(c14,plain,
organization(sk1),
inference(cnf_transformation,[status(esa)],[f14_nnf]) ).
cnf(t2,plain,
organization(sk1) = true,
inference(equality_encoding,[status(esa)],[c14]) ).
cnf(t67,plain,
organization(sk1) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t74,plain,
external_ties(sk1,X1) = ifeq(true,true,external_ties(sk1,X2),external_ties(sk1,X1)),
inference(cp,[status(thm)],[t73,t67]) ).
cnf(t8,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t29,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t8]) ).
cnf(t161,plain,
external_ties(sk1,X1) = external_ties(sk1,X2),
inference(step,[status(thm)],[t74,t29]) ).
cnf(t87,plain,
external_ties(sk1,X1) = external_ties(sk1,X2),
inference(orient,[status(thm)],[t161]) ).
cnf(t89,plain,
position(sk1,X1) = ifeq(organization(sk1),true,ifeq(external_ties(sk1,X2),external_ties(sk1,X1),position(sk1,X3),position(sk1,X1)),position(sk1,X1)),
inference(cp,[status(thm)],[t70,t87]) ).
cnf(t175,plain,
position(sk1,X1) = ifeq(true,true,ifeq(external_ties(sk1,X2),external_ties(sk1,X1),position(sk1,X3),position(sk1,X1)),position(sk1,X1)),
inference(step,[status(thm)],[t89,t67]) ).
cnf(t176,plain,
position(sk1,X1) = ifeq(external_ties(sk1,X2),external_ties(sk1,X1),position(sk1,X3),position(sk1,X1)),
inference(step,[status(thm)],[t175,t29]) ).
cnf(t134,plain,
ifeq(external_ties(sk1,X1),external_ties(sk1,X2),position(sk1,X3),position(sk1,X2)) = position(sk1,X2),
inference(orient,[status(thm)],[t176]) ).
cnf(t135,plain,
position(sk1,X1) = position(sk1,X2),
inference(cp,[status(thm)],[t134,t29]) ).
cnf(t137,plain,
position(sk1,X1) = position(sk1,X2),
inference(orient,[status(thm)],[t135]) ).
cnf(t177,plain,
eq(position(sk1,true),position(sk1,sk2)) = false,
inference(step,[status(thm)],[t145,t137]) ).
cnf(t178,plain,
eq(position(sk1,true),position(sk1,true)) = false,
inference(step,[status(thm)],[t177,t137]) ).
cnf(t3,plain,
eq(X1,X1) = true,
introduced(definition) ).
cnf(t63,plain,
eq(X1,X1) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(t179,plain,
true = false,
inference(step,[status(thm)],[t178,t63]) ).
cnf(t147,plain,
false = true,
inference(orient,[status(thm)],[t179]) ).
cnf(f8,axiom,
( ~ greater(B,A)
| ~ greater(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meaning_postulate_greater_strict_9) ).
fof(f8_nnf,plain,
! [A,B] :
( ~ greater(B,A)
| ~ greater(A,B) ),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [A,B] :
( ~ greater(B,A)
| ~ greater(A,B) ),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c8,c16]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t147]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT049-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/5.60 % Computer : n002.cluster.edu
% 0.11/5.60 % Model : x86_64 x86_64
% 0.11/5.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.60 % Memory : 8046.5625MB
% 0.11/5.60 % OS : Linux 6.8.0-71-generic
% 0.11/5.60 % CPULimit : 300
% 0.11/5.60 % WCLimit : 300
% 0.11/5.60 % DateTime : Thu Sep 24 01:15:58 UTC 2026
% 0.11/5.60 % CPUTime :
% 0.11/5.60 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 18.05/8.24 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.05/8.24 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------