%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC362+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:36 AM UTC 2026
% Result : Theorem 1.72s 0.63s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 73 ( 12 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 83 ( 27 ~; 20 |; 28 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 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 : 12 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( segmentP(V,U)
| ~ segmentP(X,W)
| ~ neq(V,nil) ) )
| 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(X,nil)
| ~ neq(V,nil) )
& ( segmentP(V,U)
| ~ segmentP(X,W)
| ~ neq(V,nil) ) )
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ~ neq(X,nil)
& neq(V,nil) )
| ( ~ segmentP(V,U)
& segmentP(X,W)
& neq(V,nil) ) )
& W = U
& X = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(fof_nnf,[status(thm)],[co1_neg]) ).
fof(sk_co1_neg_sk,plain,
( ( ( ~ neq(sK2,nil)
& neq(sK0,nil) )
| ( ~ segmentP(sK0,sK1)
& segmentP(sK2,sK3)
& neq(sK0,nil) ) )
& sK3 = sK1
& sK2 = sK0
& ssList(sK2)
& ssList(sK3)
& ssList(sK0)
& ssList(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK0,sK3,sK2]),skolemize(U,sK1),skolemize(V,sK0),skolemize(W,sK3),skolemize(X,sK2)],[nnf_87]) ).
fof(sk_co1_neg,plain,
( ( ~ neq(sK2,nil)
| ~ segmentP(sK0,sK1) )
& ( ~ neq(sK2,nil)
| segmentP(sK2,sK3) )
& neq(sK0,nil)
& sK3 = sK1
& sK2 = sK0
& ssList(sK2)
& ssList(sK3)
& ssList(sK0)
& ssList(sK1) ),
inference(cnf_transformation,[status(thm)],[sk_co1_neg_sk]) ).
cnf(c_190,negated_conjecture,
( ~ neq(sK2,nil)
| ~ segmentP(sK0,sK1) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_191,negated_conjecture,
( ~ neq(sK2,nil)
| segmentP(sK2,sK3) ),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_192,negated_conjecture,
neq(sK0,nil),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_193,negated_conjecture,
sK3 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_194,negated_conjecture,
sK2 = sK0,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_545,negated_conjecture,
( ~ neq(sK2,nil)
| segmentP(sK0,sK3) ),
inference(paramod,[status(thm)],[c_194,c_191]) ).
cnf(c_546,negated_conjecture,
( ~ neq(sK2,nil)
| segmentP(sK0,sK1) ),
inference(paramod,[status(thm)],[c_193,c_545]) ).
cnf(c_547,negated_conjecture,
( ~ neq(sK0,nil)
| segmentP(sK0,sK1) ),
inference(paramod,[status(thm)],[c_194,c_546]) ).
cnf(c_543,negated_conjecture,
segmentP(sK0,sK1),
inference(resolve,[status(thm)],[c_192,c_547]) ).
cnf(c_548,negated_conjecture,
( ~ neq(sK0,nil)
| ~ segmentP(sK0,sK1) ),
inference(paramod,[status(thm)],[c_194,c_190]) ).
cnf(c_549,negated_conjecture,
~ neq(sK0,nil),
inference(resolve,[status(thm)],[c_543,c_548]) ).
cnf(c_544,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_192,c_549]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC362+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.35 % Computer : n016.cluster.edu
% 0.06/0.35 % Model : x86_64 x86_64
% 0.06/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.35 % Memory : 8046.5625MB
% 0.06/0.35 % OS : Linux 6.8.0-71-generic
% 0.06/0.35 % CPULimit : 300
% 0.06/0.35 % WCLimit : 300
% 0.06/0.35 % DateTime : Sat Sep 26 12:58:16 UTC 2026
% 0.06/0.36 % CPUTime :
% 0.06/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.06/0.36 % Process 918772 was started by sandbox on n016,
% 0.06/0.36 % Sat Sep 26 12:58:16 2026
% 0.06/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.38
% 0.12/0.38 % From the command line: assign(max_seconds, 300).
% 1.72/0.63
% 1.72/0.63 % SZS status Theorem for theBenchmark
% 1.72/0.63
% 1.72/0.63 % Proof 1 at 0.24 (+ 0.01) seconds.
% 1.72/0.63 % Length of proof is 8.
% 1.72/0.63 % Level of proof is 3.
% 1.72/0.63 % Maximum clause weight is 6.000.
% 1.72/0.63 % Given clauses 0.
% 1.72/0.63
% 1.72/0.63 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------