%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : CSR032+2 : TPTP v9.3.1. Released v3.4.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 : n006.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:19:11 AM UTC 2026
% Result : Theorem 2.09s 2.52s
% Output : Proof 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 4 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 1 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax1_318,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('CSR002+1.ax',ax1_318) ).
fof(ax1_1014,axiom,
! [X] :
( individual(X)
=> isa(X,c_individual) ),
file('CSR002+1.ax',ax1_1014) ).
fof(query82,conjecture,
? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
file('theBenchmark.p',query82) ).
fof(f_318_1,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(fof_nnf,[status(thm)],[ax1_318]) ).
cnf(f_318_2,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(clausify,[status(thm)],[f_318_1]) ).
fof(f_1014_1,plain,
! [X] :
( isa(X,c_individual)
| ~ individual(X) ),
inference(fof_nnf,[status(thm)],[ax1_1014]) ).
fof(f_1014_2,plain,
! [U_937] :
( isa(U_937,c_individual)
| ~ individual(U_937) ),
inference(variable_rename,[status(thm)],[f_1014_1]) ).
cnf(f_1014_3,plain,
( isa(U_937,c_individual)
| ~ individual(U_937) ),
inference(clausify,[status(thm)],[f_1014_2]) ).
fof(f_1132_1,negated_conjecture,
~ ? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
inference(negate,[status(cth)],[query82]) ).
fof(f_1132_2,negated_conjecture,
! [COL] :
( ~ isa(f_citynamedfn(s_agen,c_france),COL)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(fof_nnf,[status(thm)],[f_1132_1]) ).
fof(f_1132_3,negated_conjecture,
! [U_1121] :
( ~ isa(f_citynamedfn(s_agen,c_france),U_1121)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(variable_rename,[status(thm)],[f_1132_2]) ).
fof(f_1132_4,negated_conjecture,
( ! [U_1121] : ~ isa(f_citynamedfn(s_agen,c_france),U_1121)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(miniscope,[status(thm)],[f_1132_3]) ).
fof(f_1132_5,negated_conjecture,
( ! [U_1121] : ~ isa(f_citynamedfn(s_agen,c_france),U_1121)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(definitional_conversion,[status(esa)],[f_1132_4]) ).
cnf(f_1132_7,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),U_1121),
inference(clausify,[status(thm)],[f_1132_5]) ).
cnf(t1,plain,
~ isa(f_citynamedfn(s_agen,c_france),c_individual),
inference(start,[status(thm),parent(0:0)],[f_1132_7]) ).
cnf(t2,plain,
( ~ individual(f_citynamedfn(s_agen,c_france))
| isa(f_citynamedfn(s_agen,c_france),c_individual) ),
inference(extension,[status(thm),parent(t1:1)],[f_1014_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(extension,[status(thm),parent(t2:2)],[f_318_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR032+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ 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/0.53 % Computer : n006.cluster.edu
% 0.11/0.53 % Model : x86_64 x86_64
% 0.11/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.53 % Memory : 8046.5625MB
% 0.11/0.53 % OS : Linux 6.8.0-71-generic
% 0.11/0.53 % CPULimit : 300
% 0.11/0.53 % WCLimit : 300
% 0.11/0.53 % DateTime : Sun Sep 20 15:47:00 UTC 2026
% 0.11/0.54 % CPUTime :
% 2.09/2.52 % SZS status Theorem for theBenchmark
% 2.09/2.52 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------