%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV367+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 : n016.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:31 AM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 18 unt; 0 def)
% Number of atoms : 42 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 18 ~; 6 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 32 ( 3 sgn 15 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax8,axiom,
! [U] : ~ contains_pq(create_pq,U),
file('SWV007+1.ax',ax8) ).
fof(ax54,axiom,
! [U,V] : i(triple(U,create_slb,V)) = create_pq,
file('SWV007+4.ax',ax54) ).
fof(l3_co,conjecture,
! [U,V,W] :
( contains_pq(i(triple(U,create_slb,V)),W)
=> i(remove_cpq(triple(U,create_slb,V),W)) = remove_pq(i(triple(U,create_slb,V)),W) ),
file('theBenchmark.p',l3_co) ).
fof(f_8_1,plain,
! [U] : ~ contains_pq(create_pq,U),
inference(fof_nnf,[status(thm)],[ax8]) ).
fof(f_8_2,plain,
! [U_15] : ~ contains_pq(create_pq,U_15),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
~ contains_pq(create_pq,U_15),
inference(clausify,[status(thm)],[f_8_2]) ).
fof(f_54_1,plain,
! [U,V] : i(triple(U,create_slb,V)) = create_pq,
inference(fof_nnf,[status(thm)],[ax54]) ).
fof(f_54_2,plain,
! [U_188,U_187] : i(triple(U_188,create_slb,U_187)) = create_pq,
inference(variable_rename,[status(thm)],[f_54_1]) ).
cnf(f_54_3,plain,
i(triple(U_188,create_slb,U_187)) = create_pq,
inference(clausify,[status(thm)],[f_54_2]) ).
fof(f_63_1,negated_conjecture,
~ ! [U,V,W] :
( contains_pq(i(triple(U,create_slb,V)),W)
=> i(remove_cpq(triple(U,create_slb,V),W)) = remove_pq(i(triple(U,create_slb,V)),W) ),
inference(negate,[status(cth)],[l3_co]) ).
fof(f_63_2,negated_conjecture,
? [U,V,W] :
( i(remove_cpq(triple(U,create_slb,V),W)) != remove_pq(i(triple(U,create_slb,V)),W)
& contains_pq(i(triple(U,create_slb,V)),W) ),
inference(fof_nnf,[status(thm)],[f_63_1]) ).
fof(f_63_3,negated_conjecture,
? [U_235,U_234,U_233] :
( i(remove_cpq(triple(U_235,create_slb,U_234),U_233)) != remove_pq(i(triple(U_235,create_slb,U_234)),U_233)
& contains_pq(i(triple(U_235,create_slb,U_234)),U_233) ),
inference(variable_rename,[status(thm)],[f_63_2]) ).
fof(f_63_4,negated_conjecture,
? [U_234,U_233] :
( i(remove_cpq(triple(sK5,create_slb,U_234),U_233)) != remove_pq(i(triple(sK5,create_slb,U_234)),U_233)
& contains_pq(i(triple(sK5,create_slb,U_234)),U_233) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_235,sK5)],[f_63_3]) ).
fof(f_63_5,negated_conjecture,
? [U_233] :
( i(remove_cpq(triple(sK5,create_slb,sK6),U_233)) != remove_pq(i(triple(sK5,create_slb,sK6)),U_233)
& contains_pq(i(triple(sK5,create_slb,sK6)),U_233) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_234,sK6)],[f_63_4]) ).
fof(f_63_6,negated_conjecture,
( i(remove_cpq(triple(sK5,create_slb,sK6),sK7)) != remove_pq(i(triple(sK5,create_slb,sK6)),sK7)
& contains_pq(i(triple(sK5,create_slb,sK6)),sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_233,sK7)],[f_63_5]) ).
fof(f_63_7,negated_conjecture,
( i(remove_cpq(triple(sK5,create_slb,sK6),sK7)) != remove_pq(i(triple(sK5,create_slb,sK6)),sK7)
& contains_pq(i(triple(sK5,create_slb,sK6)),sK7) ),
inference(definitional_conversion,[status(esa)],[f_63_6]) ).
cnf(f_63_8,negated_conjecture,
contains_pq(i(triple(sK5,create_slb,sK6)),sK7),
inference(clausify,[status(thm)],[f_63_7]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_33,axiom,
( contains_pq(Eq_y_0,Eq_y_1)
| ~ contains_pq(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ contains_pq(create_pq,sK7),
inference(start,[status(thm),parent(0:0)],[f_8_3]) ).
cnf(t2,plain,
( sK7 != sK7
| ~ contains_pq(i(triple(sK5,create_slb,sK6)),sK7)
| i(triple(sK5,create_slb,sK6)) != create_pq
| contains_pq(create_pq,sK7) ),
inference(extension,[status(thm),parent(t1:1)],[equality_33]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
i(triple(sK5,create_slb,sK6)) = create_pq,
inference(extension,[status(thm),parent(t2:2)],[f_54_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
contains_pq(i(triple(sK5,create_slb,sK6)),sK7),
inference(extension,[status(thm),parent(t2:3)],[f_63_8]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
sK7 = sK7,
inference(extension,[status(thm),parent(t2:4)],[equality_1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV367+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.08/0.35 % Computer : n016.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.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 03:32:20 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------