%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR032+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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 : Sun Sep 27 07:06:39 AM UTC 2026
% Result : Theorem 2.05s 0.87s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 5 unt; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 5 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax1_1014,axiom,
! [X] :
( individual(X)
=> isa(X,c_individual) ),
file('theBenchmark.p',ax1_1014) ).
fof(query82,conjecture,
? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
file('theBenchmark.p',query82) ).
fof(query82_neg,negated_conjecture,
~ ? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
inference(assume_negation,[status(cth)],[query82]) ).
fof(ax1_318,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('theBenchmark.p',ax1_318) ).
cnf(c_1443,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(clausify,[status(thm)],[ax1_318]) ).
cnf(c_1885,plain,
( isa(A,c_individual)
| ~ individual(A) ),
inference(clausify,[status(thm)],[ax1_1014]) ).
cnf(c_1963,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),A),
inference(clausify,[status(thm)],[query82_neg]) ).
cnf(c_2104,plain,
isa(f_citynamedfn(s_agen,c_france),c_individual),
inference(resolve,[status(thm)],[c_1885,c_1443]) ).
cnf(c_2103,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_1963,c_2104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR032+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 27 00:02:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 3853185 was started by sandbox2 on n013,
% 0.09/0.36 % Sun Sep 27 00:02:36 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.23/0.52
% 0.23/0.52 % From the command line: assign(max_seconds, 300).
% 0.23/0.52
% 0.23/0.52 % SInE: 735 to sos, 396 to usable, of 1131 axioms (tolerance 2.00, depth 0 fixpoint).
% 2.05/0.87
% 2.05/0.87 % SZS status Theorem for theBenchmark
% 2.05/0.87
% 2.05/0.87 % Proof 1 at 0.27 (+ 0.03) seconds.
% 2.05/0.87 % Length of proof is 6.
% 2.05/0.87 % Level of proof is 2.
% 2.05/0.87 % Maximum clause weight is 110.000.
% 2.05/0.87 % Given clauses 163.
% 2.05/0.87
% 2.05/0.87 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------