%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV400+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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 09:07:38 AM UTC 2026
% Result : Theorem 0.05s 0.37s
% Output : CNFRefutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 13 ( 5 ~; 0 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 5 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax22,axiom,
! [U,V] : ~ pair_in_list(create_slb,U,V),
file('theBenchmark.p',ax22) ).
fof(l36_co,conjecture,
! [U,V,W,X] :
( ( less_than(X,W)
& pair_in_list(create_slb,V,W) )
=> pair_in_list(update_slb(create_slb,X),V,W) ),
file('theBenchmark.p',l36_co) ).
fof(l36_co_neg,negated_conjecture,
~ ! [U,V,W,X] :
( ( less_than(X,W)
& pair_in_list(create_slb,V,W) )
=> pair_in_list(update_slb(create_slb,X),V,W) ),
inference(assume_negation,[status(cth)],[l36_co]) ).
fof(nnf_18,plain,
? [U,V,W,X] :
( ~ pair_in_list(update_slb(create_slb,X),V,W)
& less_than(X,W)
& pair_in_list(create_slb,V,W) ),
inference(fof_nnf,[status(thm)],[l36_co_neg]) ).
fof(sk_l36_co_neg,plain,
( ~ pair_in_list(update_slb(create_slb,sK2),sK0,sK1)
& less_than(sK2,sK1)
& pair_in_list(create_slb,sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(U,sK3),skolemize(V,sK0),skolemize(W,sK1),skolemize(X,sK2)],[nnf_18]) ).
cnf(c_26,negated_conjecture,
pair_in_list(create_slb,sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_l36_co_neg]) ).
cnf(c_37,plain,
~ pair_in_list(create_slb,A,B),
inference(clausify,[status(thm)],[ax22]) ).
cnf(c_38,plain,
$false,
inference(resolve,[status(thm)],[c_37,c_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV400+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.05/0.35 % Computer : n012.cluster.edu
% 0.05/0.35 % Model : x86_64 x86_64
% 0.05/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.35 % Memory : 8046.5625MB
% 0.05/0.35 % OS : Linux 6.8.0-71-generic
% 0.05/0.35 % CPULimit : 300
% 0.05/0.35 % WCLimit : 300
% 0.05/0.35 % DateTime : Sat Sep 26 13:41:05 UTC 2026
% 0.05/0.36 % CPUTime :
% 0.05/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.05/0.36 % Process 752727 was started by sandbox on n012,
% 0.05/0.36 % Sat Sep 26 13:41:05 2026
% 0.05/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.05/0.36
% 0.05/0.36 % From the command line: assign(max_seconds, 300).
% 0.05/0.37
% 0.05/0.37 % SZS status Theorem for theBenchmark
% 0.05/0.37
% 0.05/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.05/0.37 % Length of proof is 5.
% 0.05/0.37 % Level of proof is 2.
% 0.05/0.37 % Maximum clause weight is 9.000.
% 0.05/0.37 % Given clauses 0.
% 0.05/0.37
% 0.05/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------