%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR103+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n019.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:07:27 AM UTC 2026
% Result : Theorem 0.35s 0.75s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 5 ( 1 sgn 3 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_606,axiom,
! [V__THING] : s__instance(V__THING,s__Entity),
file('theBenchmark.p',kb_SUMO_606) ).
fof(prove_from_SUMO_MILO,conjecture,
! [V_X] : s__instance(V_X,s__Entity),
file('theBenchmark.p',prove_from_SUMO_MILO) ).
fof(prove_from_SUMO_MILO_neg,negated_conjecture,
~ ! [V_X] : s__instance(V_X,s__Entity),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
cnf(c_21,plain,
s__instance(A,s__Entity),
inference(clausify,[status(thm)],[kb_SUMO_606]) ).
fof(nnf_10,plain,
? [V_X] : ~ s__instance(V_X,s__Entity),
inference(fof_nnf,[status(thm)],[prove_from_SUMO_MILO_neg]) ).
fof(sk_prove_from_SUMO_MILO_neg,plain,
~ s__instance(sK0,s__Entity),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(V_X,sK0)],[nnf_10]) ).
cnf(c_29,negated_conjecture,
~ s__instance(sK0,s__Entity),
inference(split_conjunct,[status(thm)],[sk_prove_from_SUMO_MILO_neg]) ).
cnf(c_30,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_21,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR103+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.37 % Computer : n019.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Sun Sep 27 00:56:34 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.37 % Process 2597000 was started by sandbox on n019,
% 0.08/0.37 % Sun Sep 27 00:56:34 2026
% 0.08/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.35/0.75
% 0.35/0.75 % SInE (scan): 15 to sos (tol 1.5x), 2 to usable (tol 2.0x), 37964 zapped, of 37981 axioms (depth 3).
% 0.35/0.75
% 0.35/0.75 % From the command line: assign(max_seconds, 300).
% 0.35/0.75
% 0.35/0.75 % SZS status Theorem for theBenchmark
% 0.35/0.75
% 0.35/0.75 % Proof 1 at 0.05 (+ 0.05) seconds.
% 0.35/0.75 % Length of proof is 5.
% 0.35/0.75 % Level of proof is 2.
% 0.35/0.75 % Maximum clause weight is 8.000.
% 0.35/0.75 % Given clauses 0.
% 0.35/0.75
% 0.35/0.75 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------