%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN206-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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:18 AM UTC 2026
% Result : Unsatisfiable 0.54s 0.50s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 68 ( 38 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 12 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_15,axiom,
n0(a,b),
file('theBenchmark.p',axiom_15) ).
cnf(c_6,plain,
n0(a,b),
inference(clausify,[status(thm)],[axiom_15]) ).
fof(rule_002,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| l1(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_002) ).
cnf(c_10,plain,
( ~ n0(B,A)
| l1(A,A) ),
inference(clausify,[status(thm)],[rule_002]) ).
fof(rule_189,axiom,
! [VAR_0] :
( ~ s1(b)
| ~ q2(b,VAR_0,b)
| s2(VAR_0) ),
file('theBenchmark.p',rule_189) ).
cnf(c_78,plain,
( ~ s1(b)
| ~ q2(b,A,b)
| s2(A) ),
inference(clausify,[status(thm)],[rule_189]) ).
fof(rule_273,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ m0(VAR_2,VAR_3,VAR_1)
| ~ s2(VAR_0)
| ~ q2(VAR_2,VAR_0,VAR_2)
| s3(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_273) ).
cnf(c_90,plain,
( ~ m0(C,D,B)
| ~ s2(A)
| ~ q2(C,A,C)
| s3(A,B) ),
inference(clausify,[status(thm)],[rule_273]) ).
fof(prove_this,axiom,
~ s3(b,b),
file('theBenchmark.p',prove_this) ).
cnf(c_100,plain,
~ s3(b,b),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_103,plain,
( ~ s1(b)
| ~ q2(b,A,b)
| ~ m0(C,D,B)
| ~ q2(C,A,C)
| s3(A,B) ),
inference(resolve,[status(thm)],[c_90,c_78]) ).
cnf(c_139,plain,
( ~ s1(b)
| ~ q2(b,b,b)
| ~ m0(A,B,b)
| ~ q2(A,b,A) ),
inference(resolve,[status(thm)],[c_103,c_100]) ).
cnf(c_256,plain,
l1(b,b),
inference(resolve,[status(thm)],[c_10,c_6]) ).
fof(rule_186,axiom,
! [VAR_0,VAR_1] :
( ~ l1(VAR_1,VAR_0)
| q2(VAR_0,VAR_0,VAR_1) ),
file('theBenchmark.p',rule_186) ).
cnf(c_326,plain,
( ~ l1(B,A)
| q2(A,A,B) ),
inference(clausify,[status(thm)],[rule_186]) ).
fof(rule_125,axiom,
! [VAR_0] :
( ~ p0(VAR_0,VAR_0)
| s1(VAR_0) ),
file('theBenchmark.p',rule_125) ).
cnf(c_378,plain,
( ~ p0(A,A)
| s1(A) ),
inference(clausify,[status(thm)],[rule_125]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_486,plain,
m0(A,d,B),
inference(clausify,[status(thm)],[axiom_19]) ).
fof(axiom_14,axiom,
! [VAR_0] : p0(b,VAR_0),
file('theBenchmark.p',axiom_14) ).
cnf(c_490,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
cnf(c_776,plain,
( ~ s1(b)
| ~ m0(A,B,b)
| ~ q2(A,b,A)
| ~ l1(b,b) ),
inference(resolve,[status(thm)],[c_326,c_139]) ).
cnf(c_642,plain,
( ~ s1(b)
| ~ m0(A,B,b)
| ~ q2(A,b,A) ),
inference(resolve,[status(thm)],[c_256,c_776]) ).
cnf(c_724,plain,
s1(b),
inference(resolve,[status(thm)],[c_378,c_490]) ).
cnf(c_732,plain,
( ~ m0(A,B,b)
| ~ q2(A,b,A) ),
inference(resolve,[status(thm)],[c_724,c_642]) ).
cnf(c_777,plain,
( ~ l1(b,b)
| ~ m0(b,A,b) ),
inference(resolve,[status(thm)],[c_732,c_326]) ).
cnf(c_774,plain,
~ m0(b,A,b),
inference(resolve,[status(thm)],[c_256,c_777]) ).
cnf(c_775,plain,
$false,
inference(resolve,[status(thm)],[c_774,c_486]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN206-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 17:21:14 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 706620 was started by sandbox2 on n009,
% 0.10/0.37 % Sat Sep 26 17:21:14 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.39
% 0.10/0.39 % From the command line: assign(max_seconds, 300).
% 0.54/0.50
% 0.54/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.54/0.50
% 0.54/0.50 % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.54/0.50 % Length of proof is 17.
% 0.54/0.50 % Level of proof is 6.
% 0.54/0.50 % Maximum clause weight is 19.000.
% 0.54/0.50 % Given clauses 320.
% 0.54/0.50
% 0.54/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------