%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR032+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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 0.41s 0.79s
% Output : CNFRefutation 0.41s
% 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(ax3_44154,axiom,
! [X] :
( individual(X)
=> isa(X,c_individual) ),
file('theBenchmark.p',ax3_44154) ).
fof(query182,conjecture,
? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
file('theBenchmark.p',query182) ).
fof(query182_neg,negated_conjecture,
~ ? [COL] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),COL) ),
inference(assume_negation,[status(cth)],[query182]) ).
fof(ax3_14987,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('theBenchmark.p',ax3_14987) ).
cnf(c_95,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(clausify,[status(thm)],[ax3_14987]) ).
cnf(c_122,plain,
( isa(A,c_individual)
| ~ individual(A) ),
inference(clausify,[status(thm)],[ax3_44154]) ).
cnf(c_133,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),A),
inference(clausify,[status(thm)],[query182_neg]) ).
cnf(c_135,plain,
isa(f_citynamedfn(s_agen,c_france),c_individual),
inference(resolve,[status(thm)],[c_122,c_95]) ).
cnf(c_136,plain,
$false,
inference(resolve,[status(thm)],[c_135,c_133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR032+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 00:03:34 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2835864 was started by sandbox on n020,
% 0.09/0.37 % Sun Sep 27 00:03:34 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.41/0.79
% 0.41/0.79 % SInE (scan): 66 to sos (tol 1.5x), 10 to usable (tol 2.0x), 44140 zapped, of 44216 axioms (depth 3).
% 0.41/0.79
% 0.41/0.79 % From the command line: assign(max_seconds, 300).
% 0.41/0.79
% 0.41/0.79 % SZS status Theorem for theBenchmark
% 0.41/0.79
% 0.41/0.79 % Proof 1 at 0.05 (+ 0.04) seconds.
% 0.41/0.79 % Length of proof is 7.
% 0.41/0.79 % Level of proof is 3.
% 0.41/0.79 % Maximum clause weight is 110.000.
% 0.41/0.79 % Given clauses 23.
% 0.41/0.79
% 0.41/0.79 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------