%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWC151+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 : n020.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 09:01:36 AM UTC 2026
% Result : Theorem 1.94s 7.28s
% Output : Proof 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 87 ( 22 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 87 ( 20 ~; 10 |; 49 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn 8 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( totalorderP(X)
| ~ totalorderP(V)
| U != W
| V != X ) ) ) ) ),
file('theBenchmark.p',co1) ).
fof(f_96_1,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( totalorderP(X)
| ~ totalorderP(V)
| U != W
| V != X ) ) ) ) ),
inference(negate,[status(cth)],[co1]) ).
fof(f_96_2,negated_conjecture,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ~ totalorderP(X)
& totalorderP(V)
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(fof_nnf,[status(thm)],[f_96_1]) ).
fof(f_96_3,negated_conjecture,
? [U_247] :
( ? [U_246] :
( ? [U_245] :
( ? [U_244] :
( ~ totalorderP(U_244)
& totalorderP(U_246)
& U_247 = U_245
& U_246 = U_244
& ssList(U_244) )
& ssList(U_245) )
& ssList(U_246) )
& ssList(U_247) ),
inference(variable_rename,[status(thm)],[f_96_2]) ).
fof(f_96_4,negated_conjecture,
( ? [U_246] :
( ? [U_245] :
( ? [U_244] :
( ~ totalorderP(U_244)
& totalorderP(U_246)
& sK48 = U_245
& U_246 = U_244
& ssList(U_244) )
& ssList(U_245) )
& ssList(U_246) )
& ssList(sK48) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK48]),skolemize(U_247,sK48)],[f_96_3]) ).
fof(f_96_5,negated_conjecture,
( ? [U_245] :
( ? [U_244] :
( ~ totalorderP(U_244)
& totalorderP(sK49)
& sK48 = U_245
& sK49 = U_244
& ssList(U_244) )
& ssList(U_245) )
& ssList(sK49)
& ssList(sK48) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK49]),skolemize(U_246,sK49)],[f_96_4]) ).
fof(f_96_6,negated_conjecture,
( ? [U_244] :
( ~ totalorderP(U_244)
& totalorderP(sK49)
& sK48 = sK50
& sK49 = U_244
& ssList(U_244) )
& ssList(sK50)
& ssList(sK49)
& ssList(sK48) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK50]),skolemize(U_245,sK50)],[f_96_5]) ).
fof(f_96_7,negated_conjecture,
( ~ totalorderP(sK51)
& totalorderP(sK49)
& sK48 = sK50
& sK49 = sK51
& ssList(sK51)
& ssList(sK50)
& ssList(sK49)
& ssList(sK48) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK51]),skolemize(U_244,sK51)],[f_96_6]) ).
fof(f_96_8,negated_conjecture,
( ~ totalorderP(sK51)
& totalorderP(sK49)
& sK48 = sK50
& sK49 = sK51
& ssList(sK51)
& ssList(sK50)
& ssList(sK49)
& ssList(sK48) ),
inference(definitional_conversion,[status(esa)],[f_96_7]) ).
cnf(f_96_13,negated_conjecture,
sK49 = sK51,
inference(clausify,[status(thm)],[f_96_8]) ).
cnf(f_96_15,negated_conjecture,
totalorderP(sK49),
inference(clausify,[status(thm)],[f_96_8]) ).
cnf(f_96_16,negated_conjecture,
~ totalorderP(sK51),
inference(clausify,[status(thm)],[f_96_8]) ).
cnf(equality_63,axiom,
( totalorderP(Eq_y_0)
| ~ totalorderP(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ totalorderP(sK51),
inference(start,[status(thm),parent(0:0)],[f_96_16]) ).
cnf(t2,plain,
( ~ totalorderP(sK49)
| sK49 != sK51
| totalorderP(sK51) ),
inference(extension,[status(thm),parent(t1:1)],[equality_63]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
sK49 = sK51,
inference(extension,[status(thm),parent(t2:2)],[f_96_13]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
totalorderP(sK49),
inference(extension,[status(thm),parent(t2:3)],[f_96_15]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC151+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.08/5.37 % Computer : n020.cluster.edu
% 0.08/5.37 % Model : x86_64 x86_64
% 0.08/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.37 % Memory : 8046.5625MB
% 0.08/5.37 % OS : Linux 6.8.0-71-generic
% 0.08/5.37 % CPULimit : 300
% 0.08/5.37 % WCLimit : 300
% 0.08/5.37 % DateTime : Sun Sep 20 01:56:52 UTC 2026
% 0.08/5.38 % CPUTime :
% 1.94/7.28 % SZS status Theorem for theBenchmark
% 1.94/7.28 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------