%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN208-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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:18 AM UTC 2026
% Result : Unsatisfiable 1.17s 0.62s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 37 ( 17 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 89 ( 49 ~; 40 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 54 ( 18 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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_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]) ).
cnf(c_99,plain,
( ~ s0(d)
| ~ s1(a)
| ~ m0(B,C,A)
| ~ q2(B,d,B)
| s3(d,A) ),
inference(resolve,[status(thm)],[c_90,c_79]) ).
fof(prove_this,axiom,
~ s3(d,b),
file('theBenchmark.p',prove_this) ).
cnf(c_100,plain,
~ s3(d,b),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_141,plain,
( ~ s0(d)
| ~ s1(a)
| ~ m0(A,B,b)
| ~ q2(A,d,A) ),
inference(resolve,[status(thm)],[c_99,c_100]) ).
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_328,plain,
( ~ l1(B,A)
| q2(A,A,B) ),
inference(clausify,[status(thm)],[rule_186]) ).
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_379,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_380,plain,
( ~ p0(A,A)
| s1(A) ),
inference(clausify,[status(thm)],[rule_125]) ).
fof(rule_003,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ m0(VAR_1,VAR_0,VAR_2)
| ~ r0(VAR_3)
| ~ p0(VAR_2,VAR_0)
| l1(VAR_0,VAR_1) ),
file('theBenchmark.p',rule_003) ).
cnf(c_472,plain,
( ~ m0(B,A,C)
| ~ r0(D)
| ~ p0(C,A)
| l1(A,B) ),
inference(clausify,[status(thm)],[rule_003]) ).
fof(axiom_19,axiom,
! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
file('theBenchmark.p',axiom_19) ).
cnf(c_488,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_490,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_492,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
fof(axiom_13,axiom,
r0(e),
file('theBenchmark.p',axiom_13) ).
cnf(c_493,plain,
r0(e),
inference(clausify,[status(thm)],[axiom_13]) ).
fof(axiom_1,axiom,
s0(d),
file('theBenchmark.p',axiom_1) ).
cnf(c_498,plain,
s0(d),
inference(clausify,[status(thm)],[axiom_1]) ).
cnf(c_629,plain,
( ~ s1(a)
| ~ m0(A,B,b)
| ~ q2(A,d,A) ),
inference(resolve,[status(thm)],[c_498,c_141]) ).
cnf(c_732,plain,
s1(b),
inference(resolve,[status(thm)],[c_380,c_492]) ).
cnf(c_799,plain,
( ~ m0(B,A,b)
| ~ r0(C)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_472,c_492]) ).
cnf(c_800,plain,
( ~ m0(B,A,b)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_799,c_493]) ).
cnf(c_757,plain,
l1(d,A),
inference(resolve,[status(thm)],[c_800,c_488]) ).
cnf(c_801,plain,
( ~ l1(d,d)
| ~ s1(a)
| ~ m0(d,A,b) ),
inference(resolve,[status(thm)],[c_629,c_328]) ).
cnf(c_781,plain,
( ~ s1(a)
| ~ m0(d,A,b) ),
inference(resolve,[status(thm)],[c_757,c_801]) ).
cnf(c_792,plain,
~ s1(a),
inference(resolve,[status(thm)],[c_781,c_488]) ).
cnf(c_802,plain,
( ~ s1(B)
| ~ q0(a,A) ),
inference(resolve,[status(thm)],[c_379,c_792]) ).
cnf(c_797,plain,
~ s1(A),
inference(resolve,[status(thm)],[c_802,c_490]) ).
cnf(c_798,plain,
$false,
inference(resolve,[status(thm)],[c_797,c_732]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN208-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n005.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 26 17:21:31 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.36 % Process 2637648 was started by sandbox on n005,
% 0.11/0.36 % Sat Sep 26 17:21:31 2026
% 0.11/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 1.17/0.62
% 1.17/0.62 % SZS status Unsatisfiable for theBenchmark
% 1.17/0.62
% 1.17/0.62 % Proof 1 at 0.21 (+ 0.02) seconds.
% 1.17/0.62 % Length of proof is 21.
% 1.17/0.62 % Level of proof is 7.
% 1.17/0.62 % Maximum clause weight is 12.000.
% 1.17/0.62 % Given clauses 321.
% 1.17/0.62
% 1.17/0.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------