%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC391+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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 08:57:41 AM UTC 2026
% Result : Theorem 0.87s 0.62s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 49 ( 17 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 49 ( 13 ~; 8 |; 18 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn 10 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ! [Y] :
( ssItem(Y)
=> ( memberP(V,Y)
| ~ memberP(U,Y) ) )
| X != W
| U != W
| V != X ) ) ) ) ),
file('theBenchmark.p',co1) ).
fof(co1_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ! [Y] :
( ssItem(Y)
=> ( memberP(V,Y)
| ~ memberP(U,Y) ) )
| X != W
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ? [Y] :
( ~ memberP(V,Y)
& memberP(U,Y)
& ssItem(Y) )
& X = W
& W = U
& X = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(fof_nnf,[status(thm)],[co1_neg]) ).
fof(sk_co1_neg,plain,
( ~ memberP(sK1,sK4)
& memberP(sK3,sK4)
& ssItem(sK4)
& sK0 = sK2
& sK2 = sK3
& sK0 = sK1
& ssList(sK0)
& ssList(sK2)
& ssList(sK1)
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK1,sK2,sK0,sK4]),skolemize(U,sK3),skolemize(V,sK1),skolemize(W,sK2),skolemize(X,sK0),skolemize(Y,sK4)],[nnf_87]) ).
cnf(c_331,negated_conjecture,
sK0 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_332,negated_conjecture,
sK2 = sK3,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_333,negated_conjecture,
sK0 = sK2,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_339,negated_conjecture,
sK1 = sK2,
inference(paramod,[status(thm)],[c_331,c_333]) ).
cnf(c_334,negated_conjecture,
sK1 = sK3,
inference(paramod,[status(thm)],[c_332,c_339]) ).
cnf(c_336,negated_conjecture,
memberP(sK3,sK4),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_337,negated_conjecture,
~ memberP(sK1,sK4),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_340,negated_conjecture,
~ memberP(sK3,sK4),
inference(paramod,[status(thm)],[c_334,c_337]) ).
cnf(c_338,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_336,c_340]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC391+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n012.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 12:56:52 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.35 % Process 653924 was started by sandbox2 on n012,
% 0.10/0.35 % Sat Sep 26 12:56:52 2026
% 0.10/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.38
% 0.12/0.38 % From the command line: assign(max_seconds, 300).
% 0.87/0.62
% 0.87/0.62 % SZS status Theorem for theBenchmark
% 0.87/0.62
% 0.87/0.62 % Proof 1 at 0.23 (+ 0.00) seconds.
% 0.87/0.62 % Length of proof is 8.
% 0.87/0.62 % Level of proof is 3.
% 0.87/0.62 % Maximum clause weight is 3.000.
% 0.87/0.62 % Given clauses 0.
% 0.87/0.62
% 0.87/0.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------