%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS017-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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:45:54 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 12 ( 2 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_3,axiom,
! [VAR_0] :
( ~ e(VAR_0)
| r(VAR_0,u0r3(VAR_0)) ),
file('theBenchmark.p',clause_3) ).
cnf(c_1,plain,
( ~ e(A)
| r(A,u0r3(A)) ),
inference(clausify,[status(thm)],[clause_3]) ).
fof(clause_1,axiom,
e(exists),
file('theBenchmark.p',clause_1) ).
cnf(c_2,plain,
e(exists),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_4,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ r(VAR_0,VAR_2)
| ~ r(VAR_1,VAR_2)
| ~ e(VAR_1)
| a(VAR_0) ),
file('theBenchmark.p',clause_4) ).
cnf(c_3,plain,
( ~ r(A,C)
| ~ r(B,C)
| ~ e(B)
| a(A) ),
inference(clausify,[status(thm)],[clause_4]) ).
cnf(c_13,plain,
( ~ r(A,B)
| ~ r(exists,B)
| a(A) ),
inference(resolve,[status(thm)],[c_3,c_2]) ).
cnf(c_14,plain,
r(exists,u0r3(exists)),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(clause_2,axiom,
~ a(exists),
file('theBenchmark.p',clause_2) ).
cnf(c_15,plain,
~ a(exists),
inference(clausify,[status(thm)],[clause_2]) ).
cnf(c_24,plain,
( ~ r(exists,A)
| a(exists) ),
inference(factor,[status(thm)],[c_13]) ).
cnf(c_22,plain,
~ r(exists,A),
inference(resolve,[status(thm)],[c_15,c_24]) ).
cnf(c_23,plain,
$false,
inference(resolve,[status(thm)],[c_22,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS017-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n015.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 : Fri Sep 25 19:36:12 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.14/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.36 % Process 2072608 was started by sandbox on n015,
% 0.14/0.36 % Fri Sep 25 19:36:12 2026
% 0.14/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.36
% 0.14/0.36 % From the command line: assign(max_seconds, 300).
% 0.14/0.37
% 0.14/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.37
% 0.14/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/0.37 % Length of proof is 8.
% 0.14/0.37 % Level of proof is 3.
% 0.14/0.37 % Maximum clause weight is 8.000.
% 0.14/0.37 % Given clauses 0.
% 0.14/0.37
% 0.14/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------