%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV085+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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:06:47 AM UTC 2026
% Result : Theorem 0.12s 0.48s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 4 unt; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 11 ( 4 ~; 1 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(cl5_nebula_array_0026,conjecture,
( ( leq(pv68,minus(n5,n1))
& leq(n0,pv68) )
=> ( leq(pv68,minus(n5,n1))
& leq(n0,pv68) ) ),
file('theBenchmark.p',cl5_nebula_array_0026) ).
fof(cl5_nebula_array_0026_neg,negated_conjecture,
~ ( ( leq(pv68,minus(n5,n1))
& leq(n0,pv68) )
=> ( leq(pv68,minus(n5,n1))
& leq(n0,pv68) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_array_0026]) ).
cnf(c_356,negated_conjecture,
leq(n0,pv68),
inference(clausify,[status(thm)],[cl5_nebula_array_0026_neg]) ).
cnf(c_357,negated_conjecture,
leq(pv68,minus(n5,n1)),
inference(clausify,[status(thm)],[cl5_nebula_array_0026_neg]) ).
cnf(c_358,negated_conjecture,
( ~ leq(pv68,minus(n5,n1))
| ~ leq(n0,pv68) ),
inference(clausify,[status(thm)],[cl5_nebula_array_0026_neg]) ).
cnf(c_360,negated_conjecture,
~ leq(pv68,minus(n5,n1)),
inference(resolve,[status(thm)],[c_356,c_358]) ).
cnf(c_359,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_357,c_360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV085+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 13:11:17 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 3238435 was started by sandbox2 on n014,
% 0.08/0.36 % Sat Sep 26 13:11:17 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.41
% 0.12/0.41 % From the command line: assign(max_seconds, 300).
% 0.12/0.48
% 0.12/0.48 % SZS status Theorem for theBenchmark
% 0.12/0.48
% 0.12/0.48 % Proof 1 at 0.05 (+ 0.01) seconds.
% 0.12/0.48 % Length of proof is 5.
% 0.12/0.48 % Level of proof is 2.
% 0.12/0.48 % Maximum clause weight is 15.000.
% 0.12/0.48 % Given clauses 0.
% 0.12/0.48
% 0.12/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------