%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV397+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 : n005.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:37 AM UTC 2026
% Result : Theorem 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 22 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 6 ~; 2 |; 2 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 30 ( 5 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax40,axiom,
! [U,V] :
( ok(triple(U,V,bad))
<=> $false ),
file('theBenchmark.p',ax40) ).
fof(ax43,axiom,
! [U,V,W,X] :
( ~ contains_slb(V,X)
=> remove_cpq(triple(U,V,W),X) = triple(U,V,bad) ),
file('theBenchmark.p',ax43) ).
fof(l33_co,conjecture,
! [U,V,W,X] :
( ok(remove_cpq(triple(U,V,W),X))
=> contains_slb(V,X) ),
file('theBenchmark.p',l33_co) ).
fof(l33_co_neg,negated_conjecture,
~ ! [U,V,W,X] :
( ok(remove_cpq(triple(U,V,W),X))
=> contains_slb(V,X) ),
inference(assume_negation,[status(cth)],[l33_co]) ).
cnf(c_78,plain,
~ ok(triple(A,B,bad)),
inference(clausify,[status(thm)],[ax40]) ).
cnf(c_81,plain,
( triple(C,A,bad) = remove_cpq(triple(C,A,D),B)
| contains_slb(A,B) ),
inference(clausify,[status(thm)],[ax43]) ).
cnf(c_82,plain,
( remove_cpq(triple(C,A,D),B) = triple(C,A,bad)
| contains_slb(A,B) ),
inference(copy,[status(thm)],[c_81]) ).
fof(nnf_41,plain,
? [U,V,W,X] :
( ~ contains_slb(V,X)
& ok(remove_cpq(triple(U,V,W),X)) ),
inference(fof_nnf,[status(thm)],[l33_co_neg]) ).
fof(sk_l33_co_neg,plain,
( ~ contains_slb(sK1,sK3)
& ok(remove_cpq(triple(sK0,sK1,sK2),sK3)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK2),skolemize(X,sK3)],[nnf_41]) ).
cnf(c_97,negated_conjecture,
ok(remove_cpq(triple(sK0,sK1,sK2),sK3)),
inference(split_conjunct,[status(thm)],[sk_l33_co_neg]) ).
cnf(c_98,negated_conjecture,
~ contains_slb(sK1,sK3),
inference(split_conjunct,[status(thm)],[sk_l33_co_neg]) ).
cnf(c_166,plain,
remove_cpq(triple(A,sK1,B),sK3) = triple(A,sK1,bad),
inference(resolve,[status(thm)],[c_98,c_82]) ).
cnf(c_169,negated_conjecture,
ok(triple(sK0,sK1,bad)),
inference(paramod,[status(thm)],[c_166,c_97]) ).
cnf(c_168,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_78,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV397+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n005.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 26 13:40:46 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 2290467 was started by sandbox2 on n005,
% 0.09/0.35 % Sat Sep 26 13:40:46 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.36
% 0.12/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.39
% 0.12/0.39 % SZS status Theorem for theBenchmark
% 0.12/0.39
% 0.12/0.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/0.39 % Length of proof is 10.
% 0.12/0.39 % Level of proof is 4.
% 0.12/0.39 % Maximum clause weight is 14.000.
% 0.12/0.39 % Given clauses 51.
% 0.12/0.39
% 0.12/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------