%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWC262+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 : 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:18 AM UTC 2026
% Result : Theorem 3.39s 0.91s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 5 unt; 0 def)
% Number of atoms : 37 ( 9 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 38 ( 10 ~; 6 |; 14 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 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)
=> ( totalorderedP(U)
| ~ totalorderedP(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)
=> ( totalorderedP(U)
| ~ totalorderedP(W)
| U != W
| V != X ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(nnf_87,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ~ totalorderedP(U)
& totalorderedP(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,
( ~ totalorderedP(sK1)
& totalorderedP(sK0)
& sK0 = sK1
& sK3 = sK2
& ssList(sK3)
& ssList(sK0)
& ssList(sK2)
& ssList(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK0,sK3]),skolemize(U,sK1),skolemize(V,sK2),skolemize(W,sK0),skolemize(X,sK3)],[nnf_87]) ).
cnf(c_332,negated_conjecture,
sK0 = sK1,
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_333,negated_conjecture,
totalorderedP(sK0),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_334,negated_conjecture,
totalorderedP(sK1),
inference(paramod,[status(thm)],[c_332,c_333]) ).
cnf(c_335,negated_conjecture,
~ totalorderedP(sK1),
inference(split_conjunct,[status(thm)],[sk_co1_neg]) ).
cnf(c_336,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_334,c_335]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC262+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.43 % Computer : n005.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Sat Sep 26 12:37:46 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.44 % Process 2159311 was started by sandbox2 on n005,
% 0.16/0.44 % Sat Sep 26 12:37:46 2026
% 0.16/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.47
% 0.16/0.47 % From the command line: assign(max_seconds, 300).
% 3.39/0.91
% 3.39/0.91 % SZS status Theorem for theBenchmark
% 3.39/0.91
% 3.39/0.91 % Proof 1 at 0.42 (+ 0.01) seconds.
% 3.39/0.91 % Length of proof is 6.
% 3.39/0.91 % Level of proof is 3.
% 3.39/0.91 % Maximum clause weight is 3.000.
% 3.39/0.91 % Given clauses 0.
% 3.39/0.91
% 3.39/0.91 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------