%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN154-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 : n009.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:10 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.51s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 16 ( 6 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_30,axiom,
n0(e,e),
file('theBenchmark.p',axiom_30) ).
cnf(c_4,plain,
n0(e,e),
inference(clausify,[status(thm)],[axiom_30]) ).
fof(rule_002,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| l1(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_002) ).
cnf(c_10,plain,
( ~ n0(B,A)
| l1(A,A) ),
inference(clausify,[status(thm)],[rule_002]) ).
fof(rule_240,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p2(VAR_1,VAR_2,VAR_0)
| n3(VAR_0) ),
file('theBenchmark.p',rule_240) ).
cnf(c_91,plain,
( ~ p2(B,C,A)
| n3(A) ),
inference(clausify,[status(thm)],[rule_240]) ).
fof(prove_this,axiom,
~ n3(e),
file('theBenchmark.p',prove_this) ).
cnf(c_98,plain,
~ n3(e),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_254,plain,
l1(e,e),
inference(resolve,[status(thm)],[c_10,c_4]) ).
fof(rule_175,axiom,
! [VAR_0,VAR_1] :
( ~ l1(VAR_1,VAR_0)
| p2(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_175) ).
cnf(c_333,plain,
( ~ l1(B,A)
| p2(A,A,A) ),
inference(clausify,[status(thm)],[rule_175]) ).
cnf(c_543,plain,
~ p2(A,B,e),
inference(resolve,[status(thm)],[c_91,c_98]) ).
cnf(c_667,plain,
p2(e,e,e),
inference(resolve,[status(thm)],[c_333,c_254]) ).
cnf(c_666,plain,
$false,
inference(resolve,[status(thm)],[c_543,c_667]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN154-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sat Sep 26 17:16:14 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.37 % Process 698823 was started by sandbox on n009,
% 0.12/0.37 % Sat Sep 26 17:16:14 2026
% 0.12/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.38
% 0.12/0.38 % From the command line: assign(max_seconds, 300).
% 0.12/0.51
% 0.12/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.51
% 0.12/0.51 % Proof 1 at 0.11 (+ 0.01) seconds.
% 0.12/0.51 % Length of proof is 8.
% 0.12/0.51 % Level of proof is 2.
% 0.12/0.51 % Maximum clause weight is 12.000.
% 0.12/0.51 % Given clauses 141.
% 0.12/0.51
% 0.12/0.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------