%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN198-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 : n020.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:16 AM UTC 2026
% Result : Unsatisfiable 1.27s 0.56s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 11 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 15 ( 7 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,axiom,
~ s1(c),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ s1(c),
inference(clausify,[status(thm)],[prove_this]) ).
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_368,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_369,plain,
( ~ p0(A,A)
| s1(A) ),
inference(clausify,[status(thm)],[rule_125]) ).
fof(axiom_17,axiom,
! [VAR_0] : q0(VAR_0,d),
file('theBenchmark.p',axiom_17) ).
cnf(c_477,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_479,plain,
p0(b,A),
inference(clausify,[status(thm)],[axiom_14]) ).
cnf(c_621,plain,
( ~ s1(B)
| ~ q0(c,A) ),
inference(resolve,[status(thm)],[c_368,c_264]) ).
cnf(c_610,plain,
~ s1(A),
inference(resolve,[status(thm)],[c_621,c_477]) ).
cnf(c_619,plain,
s1(b),
inference(resolve,[status(thm)],[c_369,c_479]) ).
cnf(c_620,plain,
$false,
inference(resolve,[status(thm)],[c_619,c_610]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN198-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 : n020.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:21:49 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2111429 was started by sandbox2 on n020,
% 0.09/0.37 % Sat Sep 26 17:21:49 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.39
% 0.14/0.39 % From the command line: assign(max_seconds, 300).
% 1.27/0.56
% 1.27/0.56 % SZS status Unsatisfiable for theBenchmark
% 1.27/0.56
% 1.27/0.56 % Proof 1 at 0.14 (+ 0.01) seconds.
% 1.27/0.56 % Length of proof is 8.
% 1.27/0.56 % Level of proof is 2.
% 1.27/0.56 % Maximum clause weight is 7.000.
% 1.27/0.56 % Given clauses 333.
% 1.27/0.56
% 1.27/0.56 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------