%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN352-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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:40 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 38 ( 17 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause4,axiom,
! [VAR_0,VAR_1] :
( f(z(VAR_0,VAR_1),z(VAR_0,VAR_1))
| f(VAR_0,z(VAR_0,VAR_1))
| f(b,z(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause4) ).
cnf(c_4,plain,
( f(z(A,B),z(A,B))
| f(A,z(A,B))
| f(b,z(A,B)) ),
inference(clausify,[status(thm)],[clause4]) ).
fof(clause5,axiom,
! [VAR_0,VAR_1] :
( f(z(VAR_0,VAR_1),z(VAR_0,VAR_1))
| ~ f(VAR_0,z(VAR_0,VAR_1))
| ~ f(b,z(VAR_0,VAR_1)) ),
file('theBenchmark.p',clause5) ).
cnf(c_5,plain,
( f(z(A,B),z(A,B))
| ~ f(A,z(A,B))
| ~ f(b,z(A,B)) ),
inference(clausify,[status(thm)],[clause5]) ).
fof(clause6,axiom,
! [VAR_0,VAR_1] :
( ~ f(VAR_1,z(VAR_0,VAR_1))
| ~ f(VAR_0,z(VAR_0,VAR_1))
| ~ f(VAR_0,VAR_1) ),
file('theBenchmark.p',clause6) ).
cnf(c_6,plain,
( ~ f(B,z(A,B))
| ~ f(A,z(A,B))
| ~ f(A,B) ),
inference(clausify,[status(thm)],[clause6]) ).
fof(clause7,axiom,
! [VAR_0,VAR_1] :
( f(VAR_1,z(VAR_0,VAR_1))
| f(VAR_0,z(VAR_0,VAR_1))
| ~ f(VAR_0,VAR_1) ),
file('theBenchmark.p',clause7) ).
cnf(c_7,plain,
( f(B,z(A,B))
| f(A,z(A,B))
| ~ f(A,B) ),
inference(clausify,[status(thm)],[clause7]) ).
cnf(c_9,plain,
( f(z(b,A),z(b,A))
| f(b,z(b,A)) ),
inference(factor,[status(thm)],[c_4]) ).
cnf(c_10,plain,
( f(z(b,A),z(b,A))
| ~ f(b,z(b,A)) ),
inference(factor,[status(thm)],[c_5]) ).
cnf(c_11,plain,
( ~ f(A,z(A,A))
| ~ f(A,A) ),
inference(factor,[status(thm)],[c_6]) ).
cnf(c_12,plain,
( f(A,z(A,A))
| ~ f(A,A) ),
inference(factor,[status(thm)],[c_7]) ).
cnf(c_39,plain,
( f(z(b,A),z(b,A))
| f(z(b,A),z(b,A)) ),
inference(resolve,[status(thm)],[c_10,c_9]) ).
cnf(c_29,plain,
f(z(b,A),z(b,A)),
inference(copy,[status(thm)],[c_39]) ).
cnf(c_37,plain,
f(z(b,A),z(z(b,A),z(b,A))),
inference(resolve,[status(thm)],[c_29,c_12]) ).
cnf(c_40,plain,
~ f(z(b,A),z(z(b,A),z(b,A))),
inference(resolve,[status(thm)],[c_29,c_11]) ).
cnf(c_38,plain,
$false,
inference(resolve,[status(thm)],[c_37,c_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN352-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n002.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 : Sat Sep 26 17:40:05 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 2310516 was started by sandbox on n002,
% 0.09/0.36 % Sat Sep 26 17:40:05 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.36
% 0.09/0.36 % From the command line: assign(max_seconds, 300).
% 0.09/0.39
% 0.09/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39
% 0.09/0.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.39 % Length of proof is 11.
% 0.09/0.39 % Level of proof is 4.
% 0.09/0.39 % Maximum clause weight is 21.000.
% 0.09/0.39 % Given clauses 17.
% 0.09/0.39
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------