%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU247+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n019.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:58:41 AM UTC 2026
% Result : Theorem 0.08s 0.37s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 50 ( 25 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 12 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 19 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t140_relat_1,axiom,
! [A,B,C] :
( relation(C)
=> relation_dom_restriction(relation_rng_restriction(A,C),B) = relation_rng_restriction(A,relation_dom_restriction(C,B)) ),
file('theBenchmark.p',t140_relat_1) ).
fof(t17_wellord1,axiom,
! [A,B] :
( relation(B)
=> relation_restriction(B,A) = relation_dom_restriction(relation_rng_restriction(A,B),A) ),
file('theBenchmark.p',t17_wellord1) ).
fof(t18_wellord1,conjecture,
! [A,B] :
( relation(B)
=> relation_restriction(B,A) = relation_rng_restriction(A,relation_dom_restriction(B,A)) ),
file('theBenchmark.p',t18_wellord1) ).
fof(f_9_1,plain,
! [A,B,C] :
( relation_dom_restriction(relation_rng_restriction(A,C),B) = relation_rng_restriction(A,relation_dom_restriction(C,B))
| ~ relation(C) ),
inference(fof_nnf,[status(thm)],[t140_relat_1]) ).
fof(f_9_2,plain,
! [U_14,U_13,U_12] :
( relation_dom_restriction(relation_rng_restriction(U_14,U_12),U_13) = relation_rng_restriction(U_14,relation_dom_restriction(U_12,U_13))
| ~ relation(U_12) ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
cnf(f_9_3,plain,
( relation_dom_restriction(relation_rng_restriction(U_14,U_12),U_13) = relation_rng_restriction(U_14,relation_dom_restriction(U_12,U_13))
| ~ relation(U_12) ),
inference(clausify,[status(thm)],[f_9_2]) ).
fof(f_10_1,plain,
! [A,B] :
( relation_restriction(B,A) = relation_dom_restriction(relation_rng_restriction(A,B),A)
| ~ relation(B) ),
inference(fof_nnf,[status(thm)],[t17_wellord1]) ).
fof(f_10_2,plain,
! [U_16,U_15] :
( relation_restriction(U_15,U_16) = relation_dom_restriction(relation_rng_restriction(U_16,U_15),U_16)
| ~ relation(U_15) ),
inference(variable_rename,[status(thm)],[f_10_1]) ).
cnf(f_10_3,plain,
( relation_restriction(U_15,U_16) = relation_dom_restriction(relation_rng_restriction(U_16,U_15),U_16)
| ~ relation(U_15) ),
inference(clausify,[status(thm)],[f_10_2]) ).
fof(f_11_1,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> relation_restriction(B,A) = relation_rng_restriction(A,relation_dom_restriction(B,A)) ),
inference(negate,[status(cth)],[t18_wellord1]) ).
fof(f_11_2,negated_conjecture,
? [A,B] :
( relation_restriction(B,A) != relation_rng_restriction(A,relation_dom_restriction(B,A))
& relation(B) ),
inference(fof_nnf,[status(thm)],[f_11_1]) ).
fof(f_11_3,negated_conjecture,
? [U_18,U_17] :
( relation_restriction(U_17,U_18) != relation_rng_restriction(U_18,relation_dom_restriction(U_17,U_18))
& relation(U_17) ),
inference(variable_rename,[status(thm)],[f_11_2]) ).
fof(f_11_4,negated_conjecture,
? [U_17] :
( relation_restriction(U_17,sK1) != relation_rng_restriction(sK1,relation_dom_restriction(U_17,sK1))
& relation(U_17) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_18,sK1)],[f_11_3]) ).
fof(f_11_5,negated_conjecture,
( relation_restriction(sK2,sK1) != relation_rng_restriction(sK1,relation_dom_restriction(sK2,sK1))
& relation(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_17,sK2)],[f_11_4]) ).
fof(f_11_6,negated_conjecture,
( relation_restriction(sK2,sK1) != relation_rng_restriction(sK1,relation_dom_restriction(sK2,sK1))
& relation(sK2) ),
inference(definitional_conversion,[status(esa)],[f_11_5]) ).
cnf(f_11_7,negated_conjecture,
relation(sK2),
inference(clausify,[status(thm)],[f_11_6]) ).
cnf(f_11_8,negated_conjecture,
relation_restriction(sK2,sK1) != relation_rng_restriction(sK1,relation_dom_restriction(sK2,sK1)),
inference(clausify,[status(thm)],[f_11_6]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(t1,plain,
relation_restriction(sK2,sK1) != relation_rng_restriction(sK1,relation_dom_restriction(sK2,sK1)),
inference(start,[status(thm),parent(0:0)],[f_11_8]) ).
cnf(t2,plain,
( relation_dom_restriction(relation_rng_restriction(sK1,sK2),sK1) != relation_rng_restriction(sK1,relation_dom_restriction(sK2,sK1))
| relation_restriction(sK2,sK1) != relation_dom_restriction(relation_rng_restriction(sK1,sK2),sK1)
| relation_restriction(sK2,sK1) = relation_rng_restriction(sK1,relation_dom_restriction(sK2,sK1)) ),
inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ relation(sK2)
| relation_restriction(sK2,sK1) = relation_dom_restriction(relation_rng_restriction(sK1,sK2),sK1) ),
inference(extension,[status(thm),parent(t2:2)],[f_10_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
relation(sK2),
inference(extension,[status(thm),parent(t4:2)],[f_11_7]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ relation(sK2)
| relation_dom_restriction(relation_rng_restriction(sK1,sK2),sK1) = relation_rng_restriction(sK1,relation_dom_restriction(sK2,sK1)) ),
inference(extension,[status(thm),parent(t2:3)],[f_9_3]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
cnf(t10,plain,
relation(sK2),
inference(extension,[status(thm),parent(t8:2)],[f_11_7]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU247+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n019.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.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 19 23:40:07 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % SZS status Theorem for theBenchmark
% 0.08/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------