%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT052+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 : Thu Sep 24 08:50:45 AM UTC 2026
% Result : Theorem 0.09s 0.40s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 17 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 74 ( 30 ~; 26 |; 16 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn 19 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(definition_2,axiom,
! [X,T0,T] :
( dissimilar(X,T0,T)
<=> ( ~ ( is_aligned(X,T0)
<=> is_aligned(X,T) )
& organization(X) ) ),
file('theBenchmark.p',definition_2) ).
fof(background_assumption_1,conjecture,
! [X,T] : ~ dissimilar(X,T,T),
file('theBenchmark.p',background_assumption_1) ).
fof(f_7_1,plain,
! [X,T0,T] :
( ( dissimilar(X,T0,T)
| ( ( is_aligned(X,T0)
| ~ is_aligned(X,T) )
& ( is_aligned(X,T)
| ~ is_aligned(X,T0) ) )
| ~ organization(X) )
& ( ( ( ( ~ is_aligned(X,T0)
& is_aligned(X,T) )
| ( ~ is_aligned(X,T)
& is_aligned(X,T0) ) )
& organization(X) )
| ~ dissimilar(X,T0,T) ) ),
inference(fof_nnf,[status(thm)],[definition_2]) ).
fof(f_7_2,plain,
! [U_27,U_26,U_25] :
( ( dissimilar(U_27,U_26,U_25)
| ( ( is_aligned(U_27,U_26)
| ~ is_aligned(U_27,U_25) )
& ( is_aligned(U_27,U_25)
| ~ is_aligned(U_27,U_26) ) )
| ~ organization(U_27) )
& ( ( ( ( ~ is_aligned(U_27,U_26)
& is_aligned(U_27,U_25) )
| ( ~ is_aligned(U_27,U_25)
& is_aligned(U_27,U_26) ) )
& organization(U_27) )
| ~ dissimilar(U_27,U_26,U_25) ) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
( ! [U_33,U_31,U_29] :
( dissimilar(U_33,U_31,U_29)
| ( ( is_aligned(U_33,U_31)
| ~ is_aligned(U_33,U_29) )
& ( is_aligned(U_33,U_29)
| ~ is_aligned(U_33,U_31) ) )
| ~ organization(U_33) )
& ! [U_32,U_30,U_28] :
( ( ( ( ~ is_aligned(U_32,U_30)
& is_aligned(U_32,U_28) )
| ( ~ is_aligned(U_32,U_28)
& is_aligned(U_32,U_30) ) )
& organization(U_32) )
| ~ dissimilar(U_32,U_30,U_28) ) ),
inference(miniscope,[status(thm)],[f_7_2]) ).
cnf(f_7_5,plain,
( is_aligned(U_32,U_28)
| is_aligned(U_32,U_30)
| ~ dissimilar(U_32,U_30,U_28) ),
inference(clausify,[status(thm)],[f_7_3]) ).
cnf(f_7_8,plain,
( ~ is_aligned(U_32,U_30)
| ~ is_aligned(U_32,U_28)
| ~ dissimilar(U_32,U_30,U_28) ),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,negated_conjecture,
~ ! [X,T] : ~ dissimilar(X,T,T),
inference(negate,[status(cth)],[background_assumption_1]) ).
fof(f_8_2,negated_conjecture,
? [X,T] : dissimilar(X,T,T),
inference(fof_nnf,[status(thm)],[f_8_1]) ).
fof(f_8_3,negated_conjecture,
? [U_35,U_34] : dissimilar(U_35,U_34,U_34),
inference(variable_rename,[status(thm)],[f_8_2]) ).
fof(f_8_4,negated_conjecture,
? [U_34] : dissimilar(sK1,U_34,U_34),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_35,sK1)],[f_8_3]) ).
fof(f_8_5,negated_conjecture,
dissimilar(sK1,sK2,sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_34,sK2)],[f_8_4]) ).
fof(f_8_6,negated_conjecture,
dissimilar(sK1,sK2,sK2),
inference(definitional_conversion,[status(esa)],[f_8_5]) ).
cnf(f_8_7,negated_conjecture,
dissimilar(sK1,sK2,sK2),
inference(clausify,[status(thm)],[f_8_6]) ).
cnf(t1,plain,
( ~ is_aligned(sK1,sK2)
| ~ is_aligned(sK1,sK2)
| ~ dissimilar(sK1,sK2,sK2) ),
inference(start,[status(thm),parent(0:0)],[f_7_8]) ).
cnf(t2,plain,
dissimilar(sK1,sK2,sK2),
inference(extension,[status(thm),parent(t1:1)],[f_8_7]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( is_aligned(sK1,sK2)
| ~ dissimilar(sK1,sK2,sK2)
| is_aligned(sK1,sK2) ),
inference(extension,[status(thm),parent(t1:2)],[f_7_5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
cnf(t6,plain,
dissimilar(sK1,sK2,sK2),
inference(extension,[status(thm),parent(t4:2)],[f_8_7]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
$false,
inference(reduction,[status(thm),parent(t4:3)],[t4:3,t1:2]) ).
cnf(l2,lemma,
is_aligned(sK1,sK2),
inference(lemma,[status(cth),parent(t1:2),below(0:0)],[t1:2]) ).
cnf(t9,plain,
is_aligned(sK1,sK2),
inference(lemma_extension,[status(thm),parent(t1:3)],[l2:1]) ).
cnf(t10,plain,
$false,
inference(connection,[status(thm),parent(t9:1)],[t9:1,t1:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT052+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 16:16:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.40 % SZS status Theorem for theBenchmark
% 0.09/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------