%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV864-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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:09:14 AM UTC 2026
% Result : Unsatisfiable 0.21s 5.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 54 ( 37 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 44 ( 17 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 30 ( 2 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cls_com__det_0,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ c_Natural_Oevalc(VAR_2,VAR_3,VAR_1)
| ~ c_Natural_Oevalc(VAR_2,VAR_3,VAR_0)
| VAR_0 = VAR_1 ),
file('theBenchmark.p',cls_com__det_0) ).
cnf(c_15,plain,
( ~ c_Natural_Oevalc(C,D,B)
| ~ c_Natural_Oevalc(C,D,A)
| A = B ),
inference(clausify,[status(thm)],[cls_com__det_0]) ).
fof(cls_single__stateE_0,axiom,
! [VAR_0] :
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| v_sko__Hoare__Mirabelle__Xsingle__stateE__1(VAR_0) != VAR_0 ),
file('theBenchmark.p',cls_single__stateE_0) ).
cnf(c_21,plain,
( ~ c_Hoare__Mirabelle_Ostate__not__singleton
| v_sko__Hoare__Mirabelle__Xsingle__stateE__1(A) != A ),
inference(clausify,[status(thm)],[cls_single__stateE_0]) ).
fof(cls_conjecture_0,axiom,
c_Hoare__Mirabelle_Ostate__not__singleton,
file('theBenchmark.p',cls_conjecture_0) ).
cnf(c_27,plain,
c_Hoare__Mirabelle_Ostate__not__singleton,
inference(clausify,[status(thm)],[cls_conjecture_0]) ).
fof(cls_conjecture_1,axiom,
~ c_Natural_Oevalc(v_c,v_x,v_xa),
file('theBenchmark.p',cls_conjecture_1) ).
cnf(c_28,plain,
~ c_Natural_Oevalc(v_c,v_x,v_xa),
inference(clausify,[status(thm)],[cls_conjecture_1]) ).
fof(cls_conjecture_2,axiom,
! [VAR_0] :
( c_Natural_Oevalc(v_c,v_x,v_xb(VAR_0))
| VAR_0 = v_xa ),
file('theBenchmark.p',cls_conjecture_2) ).
cnf(c_29,plain,
( c_Natural_Oevalc(v_c,v_x,v_xb(A))
| A = v_xa ),
inference(clausify,[status(thm)],[cls_conjecture_2]) ).
cnf(c_30,plain,
( c_Natural_Oevalc(v_c,v_x,v_xb(A))
| v_xa = A ),
inference(copy,[status(thm)],[c_29]) ).
fof(cls_conjecture_3,axiom,
! [VAR_0] :
( VAR_0 = v_xa
| VAR_0 != v_xb(VAR_0) ),
file('theBenchmark.p',cls_conjecture_3) ).
cnf(c_31,plain,
( A = v_xa
| A != v_xb(A) ),
inference(clausify,[status(thm)],[cls_conjecture_3]) ).
cnf(c_166,plain,
( A = v_xa
| v_xb(A) != A ),
inference(copy,[status(thm)],[c_31]) ).
cnf(c_32,plain,
( v_xa = A
| v_xb(A) != A ),
inference(copy,[status(thm)],[c_166]) ).
cnf(c_36,plain,
v_sko__Hoare__Mirabelle__Xsingle__stateE__1(A) != A,
inference(resolve,[status(thm)],[c_27,c_21]) ).
cnf(c_167,plain,
( v_xa = A
| ~ c_Natural_Oevalc(v_c,v_x,B)
| v_xb(A) = B ),
inference(resolve,[status(thm)],[c_15,c_30]) ).
cnf(c_59,plain,
( v_xa = B
| v_xa = A
| v_xb(A) = v_xb(B) ),
inference(resolve,[status(thm)],[c_167,c_30]) ).
cnf(c_168,plain,
( v_xa = v_xb(A)
| v_xa = A
| v_xa = v_xb(A) ),
inference(resolve,[status(thm)],[c_59,c_32]) ).
cnf(c_169,plain,
( v_xa = v_xb(A)
| v_xa = A
| v_xb(A) = v_xa ),
inference(copy,[status(thm)],[c_168]) ).
cnf(c_170,plain,
( v_xb(A) = v_xa
| v_xa = A
| v_xb(A) = v_xa ),
inference(copy,[status(thm)],[c_169]) ).
cnf(c_162,plain,
( v_xa = A
| v_xb(A) = v_xa ),
inference(copy,[status(thm)],[c_170]) ).
cnf(c_171,plain,
( c_Natural_Oevalc(v_c,v_x,v_xa)
| v_xa = A
| v_xa = A ),
inference(paramod,[status(thm)],[c_162,c_30]) ).
cnf(c_172,plain,
( c_Natural_Oevalc(v_c,v_x,v_xa)
| v_xa = A ),
inference(copy,[status(thm)],[c_171]) ).
cnf(c_164,plain,
v_xa = A,
inference(resolve,[status(thm)],[c_28,c_172]) ).
cnf(c_173,plain,
A != v_sko__Hoare__Mirabelle__Xsingle__stateE__1(A),
inference(copy,[status(thm)],[c_36]) ).
cnf(c_165,plain,
$false,
inference(resolve,[status(thm)],[c_164,c_173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV864-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.45 % Computer : n016.cluster.edu
% 0.15/5.45 % Model : x86_64 x86_64
% 0.15/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/5.45 % Memory : 8046.5625MB
% 0.15/5.45 % OS : Linux 6.8.0-71-generic
% 0.15/5.45 % CPULimit : 300
% 0.15/5.45 % WCLimit : 300
% 0.15/5.45 % DateTime : Sat Sep 26 15:09:51 UTC 2026
% 0.15/5.45 % CPUTime :
% 0.15/5.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/5.46 % Process 1162195 was started by sandbox2 on n016,
% 0.15/5.46 % Sat Sep 26 15:09:51 2026
% 0.15/5.46 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/5.46
% 0.15/5.46 % From the command line: assign(max_seconds, 300).
% 0.21/5.51
% 0.21/5.51 % SZS status Unsatisfiable for theBenchmark
% 0.21/5.51
% 0.21/5.51 % Proof 1 at 0.02 (+ 0.02) seconds.
% 0.21/5.51 % Length of proof is 13.
% 0.21/5.51 % Level of proof is 5.
% 0.21/5.51 % Maximum clause weight is 21.000.
% 0.21/5.51 % Given clauses 69.
% 0.21/5.51
% 0.21/5.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------