%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV397+1 : TPTP v9.3.1. Released v3.3.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 : n017.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:35 AM UTC 2026
% Result : Theorem 2.66s 2.95s
% Output : Proof 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 60 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 24 ~; 15 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 54 ( 5 sgn 30 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax40,axiom,
! [U,V] :
( ok(triple(U,V,bad))
<=> $false ),
file('SWV007+3.ax',ax40) ).
fof(ax43,axiom,
! [U,V,W,X] :
( ~ contains_slb(V,X)
=> remove_cpq(triple(U,V,W),X) = triple(U,V,bad) ),
file('SWV007+3.ax',ax43) ).
fof(l33_co,conjecture,
! [U,V,W,X] :
( ok(remove_cpq(triple(U,V,W),X))
=> contains_slb(V,X) ),
file('theBenchmark.p',l33_co) ).
fof(f_28_1,plain,
! [U,V] :
( ( ok(triple(U,V,bad))
| ~ $false )
& ( $false
| ~ ok(triple(U,V,bad)) ) ),
inference(fof_nnf,[status(thm)],[ax40]) ).
fof(f_28_2,plain,
! [U_105,U_104] :
( ( ok(triple(U_105,U_104,bad))
| ~ $false )
& ( $false
| ~ ok(triple(U_105,U_104,bad)) ) ),
inference(variable_rename,[status(thm)],[f_28_1]) ).
fof(f_28_3,plain,
( ( ! [U_109,U_107] : ok(triple(U_109,U_107,bad))
| ~ $false )
& ( ! [U_108,U_106] : ~ ok(triple(U_108,U_106,bad))
| $false ) ),
inference(miniscope,[status(thm)],[f_28_2]) ).
cnf(f_28_4,plain,
( ~ ok(triple(U_108,U_106,bad))
| $false ),
inference(clausify,[status(thm)],[f_28_3]) ).
fof(f_31_1,plain,
! [U,V,W,X] :
( remove_cpq(triple(U,V,W),X) = triple(U,V,bad)
| contains_slb(V,X) ),
inference(fof_nnf,[status(thm)],[ax43]) ).
fof(f_31_2,plain,
! [U_120,U_119,U_118,U_117] :
( remove_cpq(triple(U_120,U_119,U_118),U_117) = triple(U_120,U_119,bad)
| contains_slb(U_119,U_117) ),
inference(variable_rename,[status(thm)],[f_31_1]) ).
cnf(f_31_3,plain,
( remove_cpq(triple(U_120,U_119,U_118),U_117) = triple(U_120,U_119,bad)
| contains_slb(U_119,U_117) ),
inference(clausify,[status(thm)],[f_31_2]) ).
fof(f_42_1,negated_conjecture,
~ ! [U,V,W,X] :
( ok(remove_cpq(triple(U,V,W),X))
=> contains_slb(V,X) ),
inference(negate,[status(cth)],[l33_co]) ).
fof(f_42_2,negated_conjecture,
? [U,V,W,X] :
( ~ contains_slb(V,X)
& ok(remove_cpq(triple(U,V,W),X)) ),
inference(fof_nnf,[status(thm)],[f_42_1]) ).
fof(f_42_3,negated_conjecture,
? [U_154,U_153,U_152,U_151] :
( ~ contains_slb(U_153,U_151)
& ok(remove_cpq(triple(U_154,U_153,U_152),U_151)) ),
inference(variable_rename,[status(thm)],[f_42_2]) ).
fof(f_42_4,negated_conjecture,
? [U_153,U_152,U_151] :
( ~ contains_slb(U_153,U_151)
& ok(remove_cpq(triple(sK1,U_153,U_152),U_151)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_154,sK1)],[f_42_3]) ).
fof(f_42_5,negated_conjecture,
? [U_152,U_151] :
( ~ contains_slb(sK2,U_151)
& ok(remove_cpq(triple(sK1,sK2,U_152),U_151)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_153,sK2)],[f_42_4]) ).
fof(f_42_6,negated_conjecture,
? [U_151] :
( ~ contains_slb(sK2,U_151)
& ok(remove_cpq(triple(sK1,sK2,sK3),U_151)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_152,sK3)],[f_42_5]) ).
fof(f_42_7,negated_conjecture,
( ~ contains_slb(sK2,sK4)
& ok(remove_cpq(triple(sK1,sK2,sK3),sK4)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_151,sK4)],[f_42_6]) ).
fof(f_42_8,negated_conjecture,
( ~ contains_slb(sK2,sK4)
& ok(remove_cpq(triple(sK1,sK2,sK3),sK4)) ),
inference(definitional_conversion,[status(esa)],[f_42_7]) ).
cnf(f_42_9,negated_conjecture,
ok(remove_cpq(triple(sK1,sK2,sK3),sK4)),
inference(clausify,[status(thm)],[f_42_8]) ).
cnf(f_42_10,negated_conjecture,
~ contains_slb(sK2,sK4),
inference(clausify,[status(thm)],[f_42_8]) ).
cnf(f_28_4_simplified,plain,
~ ok(triple(U_108,U_106,bad)),
inference(simplify_clause,[status(thm)],[f_28_4]) ).
cnf(equality_27,axiom,
( ok(Eq_y_0)
| ~ ok(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ contains_slb(sK2,sK4),
inference(start,[status(thm),parent(0:0)],[f_42_10]) ).
cnf(t2,plain,
( remove_cpq(triple(sK1,sK2,sK3),sK4) = triple(sK1,sK2,bad)
| contains_slb(sK2,sK4) ),
inference(extension,[status(thm),parent(t1:1)],[f_31_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ ok(remove_cpq(triple(sK1,sK2,sK3),sK4))
| ok(triple(sK1,sK2,bad))
| remove_cpq(triple(sK1,sK2,sK3),sK4) != triple(sK1,sK2,bad) ),
inference(extension,[status(thm),parent(t2:2)],[equality_27]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
~ ok(triple(sK1,sK2,bad)),
inference(extension,[status(thm),parent(t4:2)],[f_28_4_simplified]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
ok(remove_cpq(triple(sK1,sK2,sK3),sK4)),
inference(extension,[status(thm),parent(t4:3)],[f_42_9]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV397+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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n017.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 03:25:11 UTC 2026
% 0.08/0.36 % CPUTime :
% 2.66/2.95 % SZS status Theorem for theBenchmark
% 2.66/2.95 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------