%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN211-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 : n007.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.90s 0.63s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 25 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 49 ( 18 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_37,axiom,
n0(b,a),
file('theBenchmark.p',axiom_37) ).
cnf(c_2,plain,
n0(b,a),
inference(clausify,[status(thm)],[axiom_37]) ).
fof(rule_066,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| p1(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_066) ).
cnf(c_17,plain,
( ~ n0(B,A)
| p1(A,A,A) ),
inference(clausify,[status(thm)],[rule_066]) ).
fof(rule_137,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p1(VAR_1,VAR_2,VAR_0)
| n2(VAR_0) ),
file('theBenchmark.p',rule_137) ).
cnf(c_46,plain,
( ~ p1(B,C,A)
| n2(A) ),
inference(clausify,[status(thm)],[rule_137]) ).
fof(rule_244,axiom,
! [VAR_0] :
( ~ n2(VAR_0)
| p3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_244) ).
cnf(c_56,plain,
( ~ n2(A)
| p3(A,A,A) ),
inference(clausify,[status(thm)],[rule_244]) ).
fof(rule_299,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ l1(VAR_0,VAR_2)
| ~ p3(VAR_1,VAR_2,VAR_3)
| s4(VAR_0) ),
file('theBenchmark.p',rule_299) ).
cnf(c_117,plain,
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
inference(clausify,[status(thm)],[rule_299]) ).
fof(prove_this,axiom,
~ s4(d),
file('theBenchmark.p',prove_this) ).
cnf(c_124,plain,
~ s4(d),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_171,plain,
( ~ p1(B,C,A)
| p3(A,A,A) ),
inference(resolve,[status(thm)],[c_56,c_46]) ).
cnf(c_239,plain,
p1(a,a,a),
inference(resolve,[status(thm)],[c_17,c_2]) ).
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_469,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_485,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_489,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
fof(axiom_13,axiom,
r0(e),
file('theBenchmark.p',axiom_13) ).
cnf(c_490,plain,
r0(e),
inference(clausify,[status(thm)],[axiom_13]) ).
cnf(c_551,plain,
( ~ l1(d,B)
| ~ p3(A,B,C) ),
inference(resolve,[status(thm)],[c_117,c_124]) ).
cnf(c_641,plain,
p3(a,a,a),
inference(resolve,[status(thm)],[c_171,c_239]) ).
cnf(c_751,plain,
( ~ m0(B,A,b)
| ~ r0(C)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_469,c_489]) ).
cnf(c_752,plain,
( ~ m0(B,A,b)
| l1(A,B) ),
inference(resolve,[status(thm)],[c_751,c_490]) ).
cnf(c_745,plain,
l1(d,A),
inference(resolve,[status(thm)],[c_752,c_485]) ).
cnf(c_749,plain,
~ p3(A,B,C),
inference(resolve,[status(thm)],[c_745,c_551]) ).
cnf(c_750,plain,
$false,
inference(resolve,[status(thm)],[c_749,c_641]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN211-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n007.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sat Sep 26 17:19:54 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.43 % Process 59796 was started by sandbox2 on n007,
% 0.16/0.43 % Sat Sep 26 17:19:54 2026
% 0.16/0.43 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.45
% 0.16/0.45 % From the command line: assign(max_seconds, 300).
% 0.90/0.63
% 0.90/0.63 % SZS status Unsatisfiable for theBenchmark
% 0.90/0.63
% 0.90/0.63 % Proof 1 at 0.15 (+ 0.01) seconds.
% 0.90/0.63 % Length of proof is 17.
% 0.90/0.63 % Level of proof is 3.
% 0.90/0.63 % Maximum clause weight is 17.000.
% 0.90/0.63 % Given clauses 257.
% 0.90/0.63
% 0.90/0.63 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------