%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR103+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:26 AM UTC 2026
% Result : Theorem 0.10s 0.47s
% Output : CNFRefutation 0.10s
% 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_502,axiom,
! [V__THING] : s__instance(V__THING,s__Entity),
file('theBenchmark.p',kb_SUMO_502) ).
fof(prove_from_SUMO,conjecture,
! [V_X] : s__instance(V_X,s__Entity),
file('theBenchmark.p',prove_from_SUMO) ).
fof(prove_from_SUMO_neg,negated_conjecture,
~ ! [V_X] : s__instance(V_X,s__Entity),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
cnf(c_34,plain,
s__instance(A,s__Entity),
inference(clausify,[status(thm)],[kb_SUMO_502]) ).
fof(nnf_11,plain,
? [V_X] : ~ s__instance(V_X,s__Entity),
inference(fof_nnf,[status(thm)],[prove_from_SUMO_neg]) ).
fof(sk_prove_from_SUMO_neg,plain,
~ s__instance(sK0,s__Entity),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(V_X,sK0)],[nnf_11]) ).
cnf(c_42,negated_conjecture,
~ s__instance(sK0,s__Entity),
inference(split_conjunct,[status(thm)],[sk_prove_from_SUMO_neg]) ).
cnf(c_43,plain,
$false,
inference(resolve,[status(thm)],[c_42,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR103+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n012.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.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sun Sep 27 00:56:05 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.35 % Process 1847036 was started by sandbox2 on n012,
% 0.07/0.35 % Sun Sep 27 00:56:05 2026
% 0.07/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.47
% 0.10/0.47 % SInE (scan): 21 to sos (tol 1.5x), 8 to usable (tol 2.0x), 14758 zapped, of 14787 axioms (depth 3).
% 0.10/0.47
% 0.10/0.47 % From the command line: assign(max_seconds, 300).
% 0.10/0.47
% 0.10/0.47 % SZS status Theorem for theBenchmark
% 0.10/0.47
% 0.10/0.47 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.10/0.47 % Length of proof is 5.
% 0.10/0.47 % Level of proof is 2.
% 0.10/0.47 % Maximum clause weight is 3.000.
% 0.10/0.47 % Given clauses 0.
% 0.10/0.47
% 0.10/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------