%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN149-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 : n001.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:09 AM UTC 2026
% Result : Unsatisfiable 0.72s 0.50s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 7 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 10 ( 2 sgn 5 !; 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_058,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| ~ l1(VAR_1,VAR_0)
| n1(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_058) ).
cnf(c_14,plain,
( ~ n0(B,A)
| ~ l1(B,A)
| n1(A,A,A) ),
inference(clausify,[status(thm)],[rule_058]) ).
cnf(c_248,plain,
( ~ l1(e,e)
| n1(e,e,e) ),
inference(resolve,[status(thm)],[c_14,c_4]) ).
cnf(c_256,plain,
l1(e,e),
inference(resolve,[status(thm)],[c_10,c_4]) ).
fof(prove_this,axiom,
! [VAR_0] : ~ n1(e,e,VAR_0),
file('theBenchmark.p',prove_this) ).
cnf(c_264,plain,
~ n1(e,e,A),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_570,plain,
~ l1(e,e),
inference(resolve,[status(thm)],[c_264,c_248]) ).
cnf(c_569,plain,
$false,
inference(resolve,[status(thm)],[c_256,c_570]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN149-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.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 26 17:21:28 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.37 % Process 2316509 was started by sandbox on n001,
% 0.11/0.37 % Sat Sep 26 17:21:28 2026
% 0.11/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.38
% 0.11/0.38 % From the command line: assign(max_seconds, 300).
% 0.72/0.50
% 0.72/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.72/0.50
% 0.72/0.50 % Proof 1 at 0.08 (+ 0.00) seconds.
% 0.72/0.50 % Length of proof is 7.
% 0.72/0.50 % Level of proof is 2.
% 0.72/0.50 % Maximum clause weight is 12.000.
% 0.72/0.50 % Given clauses 0.
% 0.72/0.50
% 0.72/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------