%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV385+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n006.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:07:36 AM UTC 2026
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 45 ( 25 ~; 12 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 21 ( 0 sgn 12 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l21_li1316,axiom,
! [U,V,W] :
( ~ ok(triple(U,V,W))
=> ~ ok(im_succ_cpq(triple(U,V,W))) ),
file('theBenchmark.p',l21_li1316) ).
fof(l21_li2225,axiom,
! [U,V,W] :
( ~ check_cpq(triple(U,V,W))
=> ( ~ ok(im_succ_cpq(triple(U,V,W)))
| ~ check_cpq(im_succ_cpq(triple(U,V,W))) ) ),
file('theBenchmark.p',l21_li2225) ).
fof(l21_co,conjecture,
! [U,V,W] :
( ( ~ ok(triple(U,V,W))
| ~ check_cpq(triple(U,V,W)) )
=> ( ~ ok(im_succ_cpq(triple(U,V,W)))
| ~ check_cpq(im_succ_cpq(triple(U,V,W))) ) ),
file('theBenchmark.p',l21_co) ).
fof(l21_co_neg,negated_conjecture,
~ ! [U,V,W] :
( ( ~ ok(triple(U,V,W))
| ~ check_cpq(triple(U,V,W)) )
=> ( ~ ok(im_succ_cpq(triple(U,V,W)))
| ~ check_cpq(im_succ_cpq(triple(U,V,W))) ) ),
inference(assume_negation,[status(cth)],[l21_co]) ).
cnf(c_99,plain,
( ~ ok(im_succ_cpq(triple(A,B,C)))
| ok(triple(A,B,C)) ),
inference(clausify,[status(thm)],[l21_li1316]) ).
cnf(c_100,plain,
( ~ ok(im_succ_cpq(triple(A,B,C)))
| ~ check_cpq(im_succ_cpq(triple(A,B,C)))
| check_cpq(triple(A,B,C)) ),
inference(clausify,[status(thm)],[l21_li2225]) ).
fof(nnf_43,plain,
? [U,V,W] :
( ok(im_succ_cpq(triple(U,V,W)))
& check_cpq(im_succ_cpq(triple(U,V,W)))
& ( ~ ok(triple(U,V,W))
| ~ check_cpq(triple(U,V,W)) ) ),
inference(fof_nnf,[status(thm)],[l21_co_neg]) ).
fof(sk_l21_co_neg,plain,
( ok(im_succ_cpq(triple(sK0,sK1,sK2)))
& check_cpq(im_succ_cpq(triple(sK0,sK1,sK2)))
& ( ~ ok(triple(sK0,sK1,sK2))
| ~ check_cpq(triple(sK0,sK1,sK2)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK2)],[nnf_43]) ).
cnf(c_101,negated_conjecture,
( ~ ok(triple(sK0,sK1,sK2))
| ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(split_conjunct,[status(thm)],[sk_l21_co_neg]) ).
cnf(c_102,negated_conjecture,
check_cpq(im_succ_cpq(triple(sK0,sK1,sK2))),
inference(split_conjunct,[status(thm)],[sk_l21_co_neg]) ).
cnf(c_103,negated_conjecture,
ok(im_succ_cpq(triple(sK0,sK1,sK2))),
inference(split_conjunct,[status(thm)],[sk_l21_co_neg]) ).
cnf(c_249,negated_conjecture,
( ~ check_cpq(im_succ_cpq(triple(sK0,sK1,sK2)))
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(resolve,[status(thm)],[c_103,c_100]) ).
cnf(c_245,negated_conjecture,
check_cpq(triple(sK0,sK1,sK2)),
inference(resolve,[status(thm)],[c_102,c_249]) ).
cnf(c_246,plain,
ok(triple(sK0,sK1,sK2)),
inference(resolve,[status(thm)],[c_103,c_99]) ).
cnf(c_250,negated_conjecture,
~ ok(triple(sK0,sK1,sK2)),
inference(resolve,[status(thm)],[c_245,c_101]) ).
cnf(c_248,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_246,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV385+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 % Computer : n006.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Sat Sep 26 13:40:25 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.45 % Process 1394927 was started by sandbox2 on n006,
% 0.19/0.45 % Sat Sep 26 13:40:25 2026
% 0.19/0.45 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.19/0.46
% 0.19/0.46 % From the command line: assign(max_seconds, 300).
% 0.19/0.49
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49
% 0.19/0.49 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.19/0.49 % Length of proof is 11.
% 0.19/0.49 % Level of proof is 3.
% 0.19/0.49 % Maximum clause weight is 32.000.
% 0.19/0.49 % Given clauses 55.
% 0.19/0.49
% 0.19/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------