%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN721-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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 09:39:12 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 23 ( 11 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(lx1_2,axiom,
! [VAR_0,VAR_1] :
( ~ r(VAR_0,VAR_1)
| q(VAR_0,VAR_0) ),
file('theBenchmark.p',lx1_2) ).
cnf(c_1,plain,
( ~ r(A,B)
| q(A,A) ),
inference(clausify,[status(thm)],[lx1_2]) ).
fof(lx1_1,axiom,
r(a,b),
file('theBenchmark.p',lx1_1) ).
cnf(c_2,plain,
r(a,b),
inference(clausify,[status(thm)],[lx1_1]) ).
fof(lx1_3,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ q(VAR_2,VAR_1)
| r(VAR_0,VAR_1) ),
file('theBenchmark.p',lx1_3) ).
cnf(c_3,plain,
( ~ q(C,B)
| r(A,B) ),
inference(clausify,[status(thm)],[lx1_3]) ).
fof(lx1_4,axiom,
! [VAR_0] :
( ~ r(b,VAR_0)
| ~ q(VAR_0,a) ),
file('theBenchmark.p',lx1_4) ).
cnf(c_4,plain,
( ~ r(b,A)
| ~ q(A,a) ),
inference(clausify,[status(thm)],[lx1_4]) ).
cnf(c_5,plain,
( ~ q(B,A)
| ~ q(A,a) ),
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_6,plain,
( q(C,C)
| ~ q(A,B) ),
inference(resolve,[status(thm)],[c_3,c_1]) ).
cnf(c_7,plain,
q(a,a),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_8,plain,
( ~ q(C,a)
| ~ q(A,B) ),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_9,plain,
q(A,A),
inference(resolve,[status(thm)],[c_6,c_7]) ).
cnf(c_10,plain,
~ q(A,B),
inference(resolve,[status(thm)],[c_9,c_8]) ).
cnf(c_11,plain,
$false,
inference(resolve,[status(thm)],[c_10,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN721-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 18:22:01 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 2793942 was started by sandbox on n005,
% 0.08/0.35 % Sat Sep 26 18:22:01 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.35
% 0.08/0.35 % From the command line: assign(max_seconds, 300).
% 0.12/0.37
% 0.12/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.37 % Length of proof is 11.
% 0.12/0.37 % Level of proof is 4.
% 0.12/0.37 % Maximum clause weight is 6.000.
% 0.12/0.37 % Given clauses 5.
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------