%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV412+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 09:03:36 AM UTC 2026
% Result : Theorem 0.14s 10.42s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 18 ~; 8 |; 26 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 20 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l48_li3839,lemma,
! [U,V,W,X] :
( ( strictly_less_than(W,X)
& pair_in_list(U,V,W) )
=> pair_in_list(update_slb(U,X),V,X) ),
file('theBenchmark.p',l48_li3839) ).
fof(l48_co,conjecture,
! [U,V,W,X] :
( ( strictly_less_than(W,X)
& strictly_less_than(V,X)
& pair_in_list(U,V,W) )
=> pair_in_list(update_slb(U,X),V,X) ),
file('theBenchmark.p',l48_co) ).
fof(f_19_1,plain,
! [U,V,W,X] :
( pair_in_list(update_slb(U,X),V,X)
| ~ strictly_less_than(W,X)
| ~ pair_in_list(U,V,W) ),
inference(fof_nnf,[status(thm)],[l48_li3839]) ).
fof(f_19_2,plain,
! [U_72,U_71,U_70,U_69] :
( pair_in_list(update_slb(U_72,U_69),U_71,U_69)
| ~ strictly_less_than(U_70,U_69)
| ~ pair_in_list(U_72,U_71,U_70) ),
inference(variable_rename,[status(thm)],[f_19_1]) ).
cnf(f_19_3,plain,
( pair_in_list(update_slb(U_72,U_69),U_71,U_69)
| ~ strictly_less_than(U_70,U_69)
| ~ pair_in_list(U_72,U_71,U_70) ),
inference(clausify,[status(thm)],[f_19_2]) ).
fof(f_20_1,negated_conjecture,
~ ! [U,V,W,X] :
( ( strictly_less_than(W,X)
& strictly_less_than(V,X)
& pair_in_list(U,V,W) )
=> pair_in_list(update_slb(U,X),V,X) ),
inference(negate,[status(cth)],[l48_co]) ).
fof(f_20_2,negated_conjecture,
? [U,V,W,X] :
( ~ pair_in_list(update_slb(U,X),V,X)
& strictly_less_than(W,X)
& strictly_less_than(V,X)
& pair_in_list(U,V,W) ),
inference(fof_nnf,[status(thm)],[f_20_1]) ).
fof(f_20_3,negated_conjecture,
? [U_76,U_75,U_74,U_73] :
( ~ pair_in_list(update_slb(U_76,U_73),U_75,U_73)
& strictly_less_than(U_74,U_73)
& strictly_less_than(U_75,U_73)
& pair_in_list(U_76,U_75,U_74) ),
inference(variable_rename,[status(thm)],[f_20_2]) ).
fof(f_20_4,negated_conjecture,
? [U_75,U_74,U_73] :
( ~ pair_in_list(update_slb(sK1,U_73),U_75,U_73)
& strictly_less_than(U_74,U_73)
& strictly_less_than(U_75,U_73)
& pair_in_list(sK1,U_75,U_74) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_76,sK1)],[f_20_3]) ).
fof(f_20_5,negated_conjecture,
? [U_74,U_73] :
( ~ pair_in_list(update_slb(sK1,U_73),sK2,U_73)
& strictly_less_than(U_74,U_73)
& strictly_less_than(sK2,U_73)
& pair_in_list(sK1,sK2,U_74) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_75,sK2)],[f_20_4]) ).
fof(f_20_6,negated_conjecture,
? [U_73] :
( ~ pair_in_list(update_slb(sK1,U_73),sK2,U_73)
& strictly_less_than(sK3,U_73)
& strictly_less_than(sK2,U_73)
& pair_in_list(sK1,sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_74,sK3)],[f_20_5]) ).
fof(f_20_7,negated_conjecture,
( ~ pair_in_list(update_slb(sK1,sK4),sK2,sK4)
& strictly_less_than(sK3,sK4)
& strictly_less_than(sK2,sK4)
& pair_in_list(sK1,sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_73,sK4)],[f_20_6]) ).
fof(f_20_8,negated_conjecture,
( ~ pair_in_list(update_slb(sK1,sK4),sK2,sK4)
& strictly_less_than(sK3,sK4)
& strictly_less_than(sK2,sK4)
& pair_in_list(sK1,sK2,sK3) ),
inference(definitional_conversion,[status(esa)],[f_20_7]) ).
cnf(f_20_9,negated_conjecture,
pair_in_list(sK1,sK2,sK3),
inference(clausify,[status(thm)],[f_20_8]) ).
cnf(f_20_11,negated_conjecture,
strictly_less_than(sK3,sK4),
inference(clausify,[status(thm)],[f_20_8]) ).
cnf(f_20_12,negated_conjecture,
~ pair_in_list(update_slb(sK1,sK4),sK2,sK4),
inference(clausify,[status(thm)],[f_20_8]) ).
cnf(t1,plain,
~ pair_in_list(update_slb(sK1,sK4),sK2,sK4),
inference(start,[status(thm),parent(0:0)],[f_20_12]) ).
cnf(t2,plain,
( ~ strictly_less_than(sK3,sK4)
| ~ pair_in_list(sK1,sK2,sK3)
| pair_in_list(update_slb(sK1,sK4),sK2,sK4) ),
inference(extension,[status(thm),parent(t1:1)],[f_19_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
pair_in_list(sK1,sK2,sK3),
inference(extension,[status(thm),parent(t2:2)],[f_20_9]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
strictly_less_than(sK3,sK4),
inference(extension,[status(thm),parent(t2:3)],[f_20_11]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV412+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/10.38 % Computer : n019.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Sun Sep 20 03:31:33 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.14/10.42 % SZS status Theorem for theBenchmark
% 0.14/10.42 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------