%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC203+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 : n002.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:08 AM UTC 2026
% Result : Theorem 1.90s 6.23s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 10 unt; 0 def)
% Number of atoms : 46 ( 18 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 44 ( 12 ~; 8 |; 16 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( neq(U,nil)
| ~ neq(V,nil)
| 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)
=> ( neq(U,nil)
| ~ neq(V,nil)
| X != W
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ~ neq(U,nil)
& neq(V,nil)
& 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,
( ~ neq(sK0,nil)
& neq(sK1,nil)
& sK2 = sK3
& sK3 = sK0
& sK2 = sK1
& ssList(sK2)
& ssList(sK3)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK3,sK2]),skolemize(U,sK0),skolemize(V,sK1),skolemize(W,sK3),skolemize(X,sK2)],[nnf_87]) ).
cnf(c_190,negated_conjecture,
~ neq(sK0,nil),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_191,negated_conjecture,
neq(sK1,nil),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_192,negated_conjecture,
sK2 = sK3,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_193,negated_conjecture,
sK3 = sK0,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_194,negated_conjecture,
sK2 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_546,negated_conjecture,
sK3 = sK1,
inference(paramod,[status(thm)],[c_192,c_194]) ).
cnf(c_547,negated_conjecture,
sK0 = sK1,
inference(paramod,[status(thm)],[c_193,c_546]) ).
cnf(c_195,negated_conjecture,
sK1 = sK0,
inference(copy,[status(thm)],[c_547]) ).
cnf(c_548,negated_conjecture,
neq(sK0,nil),
inference(paramod,[status(thm)],[c_195,c_191]) ).
cnf(c_545,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_190,c_548]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC203+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.94 % Computer : n002.cluster.edu
% 0.11/5.94 % Model : x86_64 x86_64
% 0.11/5.94 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.94 % Memory : 8046.5625MB
% 0.11/5.94 % OS : Linux 6.8.0-71-generic
% 0.11/5.94 % CPULimit : 300
% 0.11/5.94 % WCLimit : 300
% 0.11/5.94 % DateTime : Sat Sep 26 12:33:42 UTC 2026
% 0.11/5.94 % CPUTime :
% 0.11/5.94 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.94 % Process 1730726 was started by sandbox2 on n002,
% 0.11/5.94 % Sat Sep 26 12:33:42 2026
% 0.11/5.94 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/5.97
% 0.11/5.97 % From the command line: assign(max_seconds, 300).
% 1.90/6.23
% 1.90/6.23 % SZS status Theorem for theBenchmark
% 1.90/6.23
% 1.90/6.23 % Proof 1 at 0.24 (+ 0.01) seconds.
% 1.90/6.23 % Length of proof is 8.
% 1.90/6.23 % Level of proof is 3.
% 1.90/6.23 % Maximum clause weight is 3.000.
% 1.90/6.23 % Given clauses 0.
% 1.90/6.23
% 1.90/6.23 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------