%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : CSR098+2 : 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 : 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 : Sun Sep 27 07:07:23 AM UTC 2026
% Result : Theorem 0.36s 0.87s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 9 unt; 0 def)
% Number of atoms : 9 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO_MILO,conjecture,
s__instance(s__Animal29_1,s__Amphibian),
file('theBenchmark.p',prove_from_SUMO_MILO) ).
fof(prove_from_SUMO_MILO_neg,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(local_1,axiom,
s__instance(s__Frog29_1,s__Amphibian),
file('theBenchmark.p',local_1) ).
cnf(c_888,plain,
s__instance(s__Frog29_1,s__Amphibian),
inference(clausify,[status(thm)],[local_1]) ).
fof(local_3,axiom,
s__Frog29_1 = s__Animal29_1,
file('theBenchmark.p',local_3) ).
cnf(c_890,plain,
s__Frog29_1 = s__Animal29_1,
inference(clausify,[status(thm)],[local_3]) ).
cnf(c_891,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(clausify,[status(thm)],[prove_from_SUMO_MILO_neg]) ).
cnf(c_907,plain,
s__instance(s__Animal29_1,s__Amphibian),
inference(paramod,[status(thm)],[c_890,c_888]) ).
cnf(c_906,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_891,c_907]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR098+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 00:49:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 2022650 was started by sandbox2 on n017,
% 0.10/0.37 % Sun Sep 27 00:49:04 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.36/0.87
% 0.36/0.87 % SInE (scan): 651 to sos (tol 1.5x), 62 to usable (tol 2.0x), 37271 zapped, of 37984 axioms (depth 3).
% 0.36/0.87
% 0.36/0.87 % From the command line: assign(max_seconds, 300).
% 0.36/0.87
% 0.36/0.87 % SZS status Theorem for theBenchmark
% 0.36/0.87
% 0.36/0.87 % Proof 1 at 0.13 (+ 0.07) seconds.
% 0.36/0.87 % Length of proof is 5.
% 0.36/0.87 % Level of proof is 2.
% 0.36/0.87 % Maximum clause weight is 108.000.
% 0.36/0.87 % Given clauses 0.
% 0.36/0.87
% 0.36/0.87 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------