%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : CSR032+1 : 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 : 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 08:19:11 AM UTC 2026
% Result : Theorem 0.11s 0.38s
% Output : Proof 0.11s
% 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(just1,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('theBenchmark.p',just1) ).
fof(just57,axiom,
! [X] :
( individual(X)
=> isa(X,c_individual) ),
file('theBenchmark.p',just57) ).
fof(query32,conjecture,
? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
file('theBenchmark.p',query32) ).
fof(f_1_1,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(fof_nnf,[status(thm)],[just1]) ).
cnf(f_1_2,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(clausify,[status(thm)],[f_1_1]) ).
fof(f_57_1,plain,
! [X] :
( isa(X,c_individual)
| ~ individual(X) ),
inference(fof_nnf,[status(thm)],[just57]) ).
fof(f_57_2,plain,
! [U_87] :
( isa(U_87,c_individual)
| ~ individual(U_87) ),
inference(variable_rename,[status(thm)],[f_57_1]) ).
cnf(f_57_3,plain,
( isa(U_87,c_individual)
| ~ individual(U_87) ),
inference(clausify,[status(thm)],[f_57_2]) ).
fof(f_68_1,negated_conjecture,
~ ? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
inference(negate,[status(cth)],[query32]) ).
fof(f_68_2,negated_conjecture,
! [COL] :
( ~ isa(f_citynamedfn(s_agen,c_france),COL)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(fof_nnf,[status(thm)],[f_68_1]) ).
fof(f_68_3,negated_conjecture,
! [U_107] :
( ~ isa(f_citynamedfn(s_agen,c_france),U_107)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(variable_rename,[status(thm)],[f_68_2]) ).
fof(f_68_4,negated_conjecture,
( ! [U_107] : ~ isa(f_citynamedfn(s_agen,c_france),U_107)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(miniscope,[status(thm)],[f_68_3]) ).
fof(f_68_5,negated_conjecture,
( ! [U_107] : ~ isa(f_citynamedfn(s_agen,c_france),U_107)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(definitional_conversion,[status(esa)],[f_68_4]) ).
cnf(f_68_7,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),U_107),
inference(clausify,[status(thm)],[f_68_5]) ).
cnf(t1,plain,
~ isa(f_citynamedfn(s_agen,c_france),c_individual),
inference(start,[status(thm),parent(0:0)],[f_68_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_57_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_1_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR032+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n017.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sun Sep 20 15:42:26 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.11/0.38 % SZS status Theorem for theBenchmark
% 0.11/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------