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