%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN137-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 : n010.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:08 AM UTC 2026
% Result : Unsatisfiable 0.94s 0.50s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 40 ( 18 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 113 ( 61 ~; 52 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 52 ( 13 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_11,axiom,
n0(e,b),
file('theBenchmark.p',axiom_11) ).
cnf(c_7,plain,
n0(e,b),
inference(clausify,[status(thm)],[axiom_11]) ).
fof(rule_131,axiom,
! [VAR_0,VAR_1] :
( ~ l2(VAR_1,VAR_1)
| ~ n0(e,VAR_1)
| ~ s1(VAR_0)
| l2(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_131) ).
cnf(c_23,plain,
( ~ l2(B,B)
| ~ n0(e,B)
| ~ s1(A)
| l2(A,B) ),
inference(clausify,[status(thm)],[rule_131]) ).
fof(rule_190,axiom,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
file('theBenchmark.p',rule_190) ).
cnf(c_79,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(clausify,[status(thm)],[rule_190]) ).
fof(rule_225,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ s2(VAR_2)
| ~ m0(VAR_0,VAR_3,VAR_3)
| ~ l2(VAR_3,VAR_0)
| ~ m0(VAR_2,VAR_2,VAR_1)
| m3(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_225) ).
cnf(c_85,plain,
( ~ s2(C)
| ~ m0(A,D,D)
| ~ l2(D,A)
| ~ m0(C,C,B)
| m3(A,B,A) ),
inference(clausify,[status(thm)],[rule_225]) ).
cnf(c_150,plain,
( ~ s0(d)
| ~ s1(a)
| ~ m0(A,C,C)
| ~ l2(C,A)
| ~ m0(d,d,B)
| m3(A,B,A) ),
inference(resolve,[status(thm)],[c_85,c_79]) ).
cnf(c_220,plain,
( ~ l2(b,b)
| ~ s1(A)
| l2(A,b) ),
inference(resolve,[status(thm)],[c_23,c_7]) ).
fof(prove_this,axiom,
~ m3(b,c,b),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ m3(b,c,b),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_133,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ m0(VAR_3,VAR_2,VAR_0)
| ~ s1(VAR_2)
| ~ p0(VAR_1,VAR_1)
| l2(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_133) ).
cnf(c_365,plain,
( ~ m0(D,C,A)
| ~ s1(C)
| ~ p0(B,B)
| l2(A,A) ),
inference(clausify,[status(thm)],[rule_133]) ).
fof(rule_126,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ s1(VAR_2)
| ~ q0(VAR_0,VAR_1)
| s1(VAR_0) ),
file('theBenchmark.p',rule_126) ).
cnf(c_370,plain,
( ~ s1(C)
| ~ q0(A,B)
| s1(A) ),
inference(clausify,[status(thm)],[rule_126]) ).
fof(rule_125,axiom,
! [VAR_0] :
( ~ p0(VAR_0,VAR_0)
| s1(VAR_0) ),
file('theBenchmark.p',rule_125) ).
cnf(c_371,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_477,plain,
m0(A,d,B),
inference(clausify,[status(thm)],[axiom_19]) ).
fof(axiom_17,axiom,
! [VAR_0] : q0(VAR_0,d),
file('theBenchmark.p',axiom_17) ).
cnf(c_479,plain,
q0(A,d),
inference(clausify,[status(thm)],[axiom_17]) ).
fof(axiom_14,axiom,
! [VAR_0] : p0(b,VAR_0),
file('theBenchmark.p',axiom_14) ).
cnf(c_481,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
fof(axiom_1,axiom,
s0(d),
file('theBenchmark.p',axiom_1) ).
cnf(c_487,plain,
s0(d),
inference(clausify,[status(thm)],[axiom_1]) ).
cnf(c_623,plain,
s1(b),
inference(resolve,[status(thm)],[c_371,c_481]) ).
cnf(c_689,plain,
( ~ s1(B)
| s1(A) ),
inference(resolve,[status(thm)],[c_370,c_479]) ).
cnf(c_670,plain,
s1(A),
inference(resolve,[status(thm)],[c_689,c_623]) ).
cnf(c_690,plain,
( ~ m0(C,B,A)
| ~ s1(B)
| l2(A,A) ),
inference(resolve,[status(thm)],[c_365,c_481]) ).
cnf(c_691,plain,
( ~ m0(B,C,A)
| l2(A,A) ),
inference(resolve,[status(thm)],[c_690,c_670]) ).
cnf(c_676,plain,
l2(A,A),
inference(resolve,[status(thm)],[c_691,c_477]) ).
cnf(c_692,plain,
( ~ s0(d)
| ~ s1(a)
| ~ m0(b,A,A)
| ~ l2(A,b)
| ~ m0(d,d,c) ),
inference(resolve,[status(thm)],[c_150,c_264]) ).
cnf(c_693,plain,
( ~ s0(d)
| ~ s1(a)
| ~ m0(b,A,A)
| ~ l2(A,b) ),
inference(resolve,[status(thm)],[c_692,c_477]) ).
cnf(c_694,plain,
( ~ s0(d)
| ~ s1(a)
| ~ l2(d,b) ),
inference(resolve,[status(thm)],[c_693,c_477]) ).
cnf(c_695,plain,
( ~ s0(d)
| ~ l2(d,b) ),
inference(resolve,[status(thm)],[c_694,c_670]) ).
cnf(c_682,plain,
~ l2(d,b),
inference(resolve,[status(thm)],[c_695,c_487]) ).
cnf(c_696,plain,
( ~ l2(b,b)
| ~ s1(d) ),
inference(resolve,[status(thm)],[c_220,c_682]) ).
cnf(c_687,plain,
~ l2(b,b),
inference(resolve,[status(thm)],[c_696,c_670]) ).
cnf(c_688,plain,
$false,
inference(resolve,[status(thm)],[c_687,c_676]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN137-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.09/0.36 % Computer : n010.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:15:17 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 3792702 was started by sandbox2 on n010,
% 0.09/0.37 % Sat Sep 26 17:15:17 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.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.94/0.50
% 0.94/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.94/0.50
% 0.94/0.50 % Proof 1 at 0.10 (+ 0.02) seconds.
% 0.94/0.50 % Length of proof is 20.
% 0.94/0.50 % Level of proof is 5.
% 0.94/0.50 % Maximum clause weight is 24.000.
% 0.94/0.50 % Given clauses 387.
% 0.94/0.50
% 0.94/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------