%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV365+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 : 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 09:07:34 AM UTC 2026
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 16 ( 2 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax54,axiom,
! [U,V] : i(triple(U,create_slb,V)) = create_pq,
file('theBenchmark.p',ax54) ).
fof(l1_co,conjecture,
! [U,V,X,Y] : i(triple(U,create_slb,X)) = i(triple(V,create_slb,Y)),
file('theBenchmark.p',l1_co) ).
fof(l1_co_neg,negated_conjecture,
~ ! [U,V,X,Y] : i(triple(U,create_slb,X)) = i(triple(V,create_slb,Y)),
inference(assume_negation,[status(cth)],[l1_co]) ).
fof(nnf_61,plain,
? [U,V,X,Y] : i(triple(V,create_slb,Y)) != i(triple(U,create_slb,X)),
inference(fof_nnf,[status(thm)],[l1_co_neg]) ).
fof(sk_l1_co_neg,plain,
i(triple(sK0,create_slb,sK1)) != i(triple(sK2,create_slb,sK3)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(U,sK2),skolemize(V,sK0),skolemize(X,sK3),skolemize(Y,sK1)],[nnf_61]) ).
cnf(c_132,negated_conjecture,
i(triple(sK0,create_slb,sK1)) != i(triple(sK2,create_slb,sK3)),
inference(split_conjunct,[status(thm)],[sk_l1_co_neg]) ).
cnf(c_135,plain,
i(triple(A,create_slb,B)) = create_pq,
inference(clausify,[status(thm)],[ax54]) ).
cnf(c_199,negated_conjecture,
create_pq != i(triple(sK2,create_slb,sK3)),
inference(paramod,[status(thm)],[c_135,c_132]) ).
cnf(c_200,negated_conjecture,
create_pq != create_pq,
inference(paramod,[status(thm)],[c_135,c_199]) ).
cnf(c_198,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV365+1 : TPTP v9.3.1. Released v3.3.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 13:38:46 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 2286014 was started by sandbox on n005,
% 0.10/0.37 % Sat Sep 26 13:38:46 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.39
% 0.15/0.39 % From the command line: assign(max_seconds, 300).
% 0.15/0.41
% 0.15/0.41 % SZS status Theorem for theBenchmark
% 0.15/0.41
% 0.15/0.41 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.15/0.41 % Length of proof is 5.
% 0.15/0.41 % Level of proof is 2.
% 0.15/0.41 % Maximum clause weight is 11.000.
% 0.15/0.41 % Given clauses 0.
% 0.15/0.41
% 0.15/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------