%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN121-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 : n019.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:06 AM UTC 2026
% Result : Unsatisfiable 0.15s 5.52s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 73 ( 41 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 36 ( 8 sgn 14 !; 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]) ).
cnf(c_220,plain,
( ~ l2(b,b)
| ~ s1(A)
| l2(A,b) ),
inference(resolve,[status(thm)],[c_23,c_7]) ).
fof(prove_this,axiom,
~ l2(a,b),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ l2(a,b),
inference(clausify,[status(thm)],[prove_this]) ).
fof(rule_134,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p0(VAR_1,VAR_0)
| ~ m1(VAR_2,VAR_1,VAR_1)
| ~ m0(VAR_1,VAR_0,VAR_2)
| l2(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_134) ).
cnf(c_368,plain,
( ~ p0(B,A)
| ~ m1(C,B,B)
| ~ m0(B,A,C)
| l2(A,A) ),
inference(clausify,[status(thm)],[rule_134]) ).
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_375,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_376,plain,
( ~ p0(A,A)
| s1(A) ),
inference(clausify,[status(thm)],[rule_125]) ).
fof(rule_015,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ m0(VAR_1,VAR_1,VAR_0)
| ~ l0(VAR_2)
| m1(VAR_0,VAR_1,VAR_1) ),
file('theBenchmark.p',rule_015) ).
cnf(c_462,plain,
( ~ m0(B,B,A)
| ~ l0(C)
| m1(A,B,B) ),
inference(clausify,[status(thm)],[rule_015]) ).
fof(axiom_31,axiom,
m0(b,b,e),
file('theBenchmark.p',axiom_31) ).
cnf(c_474,plain,
m0(b,b,e),
inference(clausify,[status(thm)],[axiom_31]) ).
fof(axiom_24,axiom,
l0(c),
file('theBenchmark.p',axiom_24) ).
cnf(c_479,plain,
l0(c),
inference(clausify,[status(thm)],[axiom_24]) ).
fof(axiom_17,axiom,
! [VAR_0] : q0(VAR_0,d),
file('theBenchmark.p',axiom_17) ).
cnf(c_486,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_488,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
cnf(c_640,plain,
( ~ l2(b,b)
| ~ s1(a) ),
inference(resolve,[status(thm)],[c_264,c_220]) ).
cnf(c_831,plain,
( ~ m0(B,B,A)
| m1(A,B,B) ),
inference(resolve,[status(thm)],[c_462,c_479]) ).
cnf(c_678,plain,
m1(e,b,b),
inference(resolve,[status(thm)],[c_831,c_474]) ).
cnf(c_722,plain,
s1(b),
inference(resolve,[status(thm)],[c_376,c_488]) ).
cnf(c_770,plain,
( ~ s1(B)
| ~ q0(a,A)
| ~ l2(b,b) ),
inference(resolve,[status(thm)],[c_640,c_375]) ).
cnf(c_777,plain,
( ~ s1(A)
| ~ l2(b,b) ),
inference(resolve,[status(thm)],[c_770,c_486]) ).
cnf(c_782,plain,
~ l2(b,b),
inference(resolve,[status(thm)],[c_722,c_777]) ).
cnf(c_832,plain,
( ~ p0(A,b)
| ~ m1(B,A,A)
| ~ m0(A,b,B) ),
inference(resolve,[status(thm)],[c_368,c_782]) ).
cnf(c_833,plain,
( ~ p0(b,b)
| ~ m1(e,b,b) ),
inference(resolve,[status(thm)],[c_832,c_474]) ).
cnf(c_834,plain,
~ m1(e,b,b),
inference(resolve,[status(thm)],[c_833,c_488]) ).
cnf(c_830,plain,
$false,
inference(resolve,[status(thm)],[c_678,c_834]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN121-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.11/5.38 % Computer : n019.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Sat Sep 26 17:13:55 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.38 % Process 1829164 was started by sandbox2 on n019,
% 0.11/5.38 % Sat Sep 26 17:13:55 2026
% 0.11/5.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/5.40
% 0.15/5.40 % From the command line: assign(max_seconds, 300).
% 0.15/5.52
% 0.15/5.52 % SZS status Unsatisfiable for theBenchmark
% 0.15/5.52
% 0.15/5.52 % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.15/5.52 % Length of proof is 19.
% 0.15/5.52 % Level of proof is 6.
% 0.15/5.52 % Maximum clause weight is 19.000.
% 0.15/5.52 % Given clauses 331.
% 0.15/5.52
% 0.15/5.52 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------