%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN296-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 : n002.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:30 AM UTC 2026
% Result : Unsatisfiable 1.02s 0.52s
% Output : CNFRefutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 13 ( 5 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_15,axiom,
n0(a,b),
file('theBenchmark.p',axiom_15) ).
cnf(c_6,plain,
n0(a,b),
inference(clausify,[status(thm)],[axiom_15]) ).
fof(rule_092,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ p0(VAR_3,VAR_0)
| ~ n0(VAR_2,VAR_1)
| q1(VAR_0,VAR_1,VAR_0) ),
file('theBenchmark.p',rule_092) ).
cnf(c_21,plain,
( ~ p0(D,A)
| ~ n0(C,B)
| q1(A,B,A) ),
inference(clausify,[status(thm)],[rule_092]) ).
cnf(c_227,plain,
( ~ p0(B,A)
| q1(A,b,A) ),
inference(resolve,[status(thm)],[c_21,c_6]) ).
fof(prove_this,axiom,
~ q1(e,b,e),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ q1(e,b,e),
inference(clausify,[status(thm)],[prove_this]) ).
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]) ).
cnf(c_641,plain,
~ p0(A,e),
inference(resolve,[status(thm)],[c_264,c_227]) ).
cnf(c_642,plain,
$false,
inference(resolve,[status(thm)],[c_641,c_489]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN296-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.08/0.34 % Computer : n002.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 26 17:33:35 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 2296287 was started by sandbox2 on n002,
% 0.08/0.35 % Sat Sep 26 17:33:35 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 1.02/0.52
% 1.02/0.52 % SZS status Unsatisfiable for theBenchmark
% 1.02/0.52
% 1.02/0.52 % Proof 1 at 0.13 (+ 0.01) seconds.
% 1.02/0.52 % Length of proof is 7.
% 1.02/0.52 % Level of proof is 3.
% 1.02/0.52 % Maximum clause weight is 12.000.
% 1.02/0.52 % Given clauses 80.
% 1.02/0.52
% 1.02/0.52 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------