%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN323-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:37:33 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause2,axiom,
! [VAR_0] :
( g(VAR_0,a)
| ~ f(a,VAR_0) ),
file('theBenchmark.p',clause2) ).
cnf(c_1,plain,
( g(A,a)
| ~ f(a,A) ),
inference(clausify,[status(thm)],[clause2]) ).
fof(clause1,axiom,
! [VAR_0] :
( g(VAR_0,a)
| f(VAR_0,a) ),
file('theBenchmark.p',clause1) ).
cnf(c_2,plain,
( g(A,a)
| f(A,a) ),
inference(clausify,[status(thm)],[clause1]) ).
fof(clause3,axiom,
! [VAR_0] :
( ~ g(VAR_0,a)
| f(VAR_0,a) ),
file('theBenchmark.p',clause3) ).
cnf(c_3,plain,
( ~ g(A,a)
| f(A,a) ),
inference(clausify,[status(thm)],[clause3]) ).
fof(clause4,axiom,
! [VAR_0] :
( ~ g(VAR_0,a)
| ~ f(a,VAR_0) ),
file('theBenchmark.p',clause4) ).
cnf(c_4,plain,
( ~ g(A,a)
| ~ f(a,A) ),
inference(clausify,[status(thm)],[clause4]) ).
cnf(c_5,plain,
( ~ g(a,a)
| ~ g(a,a) ),
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_6,plain,
~ g(a,a),
inference(copy,[status(thm)],[c_5]) ).
cnf(c_7,plain,
( g(a,a)
| g(a,a) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
cnf(c_9,plain,
g(a,a),
inference(copy,[status(thm)],[c_7]) ).
cnf(c_8,plain,
$false,
inference(resolve,[status(thm)],[c_6,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN323-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 17:34:02 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2659215 was started by sandbox2 on n005,
% 0.09/0.37 % Sat Sep 26 17:34:02 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.37
% 0.09/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.37
% 0.09/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37 % Length of proof is 8.
% 0.09/0.37 % Level of proof is 3.
% 0.09/0.37 % Maximum clause weight is 3.000.
% 0.09/0.37 % Given clauses 0.
% 0.09/0.37
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------