%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GEO499+1 : TPTP v9.3.1. Released v7.0.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 : n007.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:40:25 AM UTC 2026
% Result : Theorem 60.63s 60.91s
% Output : Proof 60.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 18 unt; 0 def)
% Number of atoms : 62 ( 14 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 17 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 36 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz7_7,axiom,
! [Xa,Xp] : s(Xa,s(Xa,Xp)) = Xp,
file('theBenchmark.p',aSatz7_7) ).
fof(aSatz7_15a,axiom,
! [Xp,Xq,Xr,Xa] :
( s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr))
| ~ s_t(Xp,Xq,Xr) ),
file('theBenchmark.p',aSatz7_15a) ).
fof(aSatz7_15b,conjecture,
! [Xp,Xq,Xr,Xa] :
( ~ s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr))
| s_t(Xp,Xq,Xr) ),
file('theBenchmark.p',aSatz7_15b) ).
fof(f_99_1,plain,
! [Xa,Xp] : s(Xa,s(Xa,Xp)) = Xp,
inference(fof_nnf,[status(thm)],[aSatz7_7]) ).
fof(f_99_2,plain,
! [U_449,U_448] : s(U_449,s(U_449,U_448)) = U_448,
inference(variable_rename,[status(thm)],[f_99_1]) ).
fof(f_99_3,plain,
! [U_448,U_449] : s(U_449,s(U_449,U_448)) = U_448,
inference(definitional_conversion,[status(esa)],[f_99_2]) ).
cnf(f_99_4,plain,
s(U_449,s(U_449,U_448)) = U_448,
inference(clausify,[status(thm)],[f_99_3]) ).
fof(f_105_1,plain,
! [Xp,Xq,Xr,Xa] :
( s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr))
| ~ s_t(Xp,Xq,Xr) ),
inference(fof_nnf,[status(thm)],[aSatz7_15a]) ).
fof(f_105_2,plain,
! [U_467,U_466,U_465,U_464] :
( s_t(s(U_464,U_467),s(U_464,U_466),s(U_464,U_465))
| ~ s_t(U_467,U_466,U_465) ),
inference(variable_rename,[status(thm)],[f_105_1]) ).
fof(f_105_3,plain,
! [U_467,U_466,U_465] :
( ! [U_464] : s_t(s(U_464,U_467),s(U_464,U_466),s(U_464,U_465))
| ~ s_t(U_467,U_466,U_465) ),
inference(miniscope,[status(thm)],[f_105_2]) ).
fof(f_105_4,plain,
! [U_464,U_465,U_466,U_467] :
( s_t(s(U_464,U_467),s(U_464,U_466),s(U_464,U_465))
| ~ s_t(U_467,U_466,U_465) ),
inference(definitional_conversion,[status(esa)],[f_105_3]) ).
cnf(f_105_5,plain,
( s_t(s(U_464,U_467),s(U_464,U_466),s(U_464,U_465))
| ~ s_t(U_467,U_466,U_465) ),
inference(clausify,[status(thm)],[f_105_4]) ).
fof(f_106_1,negated_conjecture,
~ ! [Xp,Xq,Xr,Xa] :
( ~ s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr))
| s_t(Xp,Xq,Xr) ),
inference(negate,[status(cth)],[aSatz7_15b]) ).
fof(f_106_2,negated_conjecture,
? [Xp,Xq,Xr,Xa] :
( s_t(s(Xa,Xp),s(Xa,Xq),s(Xa,Xr))
& ~ s_t(Xp,Xq,Xr) ),
inference(fof_nnf,[status(thm)],[f_106_1]) ).
fof(f_106_3,negated_conjecture,
? [U_471,U_470,U_469,U_468] :
( s_t(s(U_468,U_471),s(U_468,U_470),s(U_468,U_469))
& ~ s_t(U_471,U_470,U_469) ),
inference(variable_rename,[status(thm)],[f_106_2]) ).
fof(f_106_4,negated_conjecture,
? [U_471,U_470,U_469] :
( ? [U_468] : s_t(s(U_468,U_471),s(U_468,U_470),s(U_468,U_469))
& ~ s_t(U_471,U_470,U_469) ),
inference(miniscope,[status(thm)],[f_106_3]) ).
fof(f_106_5,negated_conjecture,
? [U_470,U_469] :
( ? [U_468] : s_t(s(U_468,sK1),s(U_468,U_470),s(U_468,U_469))
& ~ s_t(sK1,U_470,U_469) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_471,sK1)],[f_106_4]) ).
fof(f_106_6,negated_conjecture,
? [U_469] :
( ? [U_468] : s_t(s(U_468,sK1),s(U_468,sK2),s(U_468,U_469))
& ~ s_t(sK1,sK2,U_469) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_470,sK2)],[f_106_5]) ).
fof(f_106_7,negated_conjecture,
( ? [U_468] : s_t(s(U_468,sK1),s(U_468,sK2),s(U_468,sK3))
& ~ s_t(sK1,sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_469,sK3)],[f_106_6]) ).
fof(f_106_8,negated_conjecture,
( s_t(s(sK4,sK1),s(sK4,sK2),s(sK4,sK3))
& ~ s_t(sK1,sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_468,sK4)],[f_106_7]) ).
fof(f_106_9,negated_conjecture,
( s_t(s(sK4,sK1),s(sK4,sK2),s(sK4,sK3))
& ~ s_t(sK1,sK2,sK3) ),
inference(definitional_conversion,[status(esa)],[f_106_8]) ).
cnf(f_106_10,negated_conjecture,
~ s_t(sK1,sK2,sK3),
inference(clausify,[status(thm)],[f_106_9]) ).
cnf(f_106_11,negated_conjecture,
s_t(s(sK4,sK1),s(sK4,sK2),s(sK4,sK3)),
inference(clausify,[status(thm)],[f_106_9]) ).
cnf(equality_14,axiom,
( s_t(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ s_t(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
s_t(s(sK4,sK1),s(sK4,sK2),s(sK4,sK3)),
inference(start,[status(thm),parent(0:0)],[f_106_11]) ).
cnf(t2,plain,
( s_t(s(sK4,s(sK4,sK1)),s(sK4,s(sK4,sK2)),s(sK4,s(sK4,sK3)))
| ~ s_t(s(sK4,sK1),s(sK4,sK2),s(sK4,sK3)) ),
inference(extension,[status(thm),parent(t1:1)],[f_105_5]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( s(sK4,s(sK4,sK2)) != sK2
| s(sK4,s(sK4,sK3)) != sK3
| s_t(sK1,sK2,sK3)
| s(sK4,s(sK4,sK1)) != sK1
| ~ s_t(s(sK4,s(sK4,sK1)),s(sK4,s(sK4,sK2)),s(sK4,s(sK4,sK3))) ),
inference(extension,[status(thm),parent(t2:2)],[equality_14]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
s(sK4,s(sK4,sK1)) = sK1,
inference(extension,[status(thm),parent(t4:2)],[f_99_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
~ s_t(sK1,sK2,sK3),
inference(extension,[status(thm),parent(t4:3)],[f_106_10]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
s(sK4,s(sK4,sK3)) = sK3,
inference(extension,[status(thm),parent(t4:4)],[f_99_4]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:4]) ).
cnf(t12,plain,
s(sK4,s(sK4,sK2)) = sK2,
inference(extension,[status(thm),parent(t4:5)],[f_99_4]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t4:5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO499+1 : TPTP v9.3.1. Released v7.0.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.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sat Sep 19 07:58:05 UTC 2026
% 0.11/0.39 % CPUTime :
% 60.63/60.91 % SZS status Theorem for theBenchmark
% 60.63/60.91 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------