%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU167+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:45:17 AM UTC 2026
% Result : Theorem 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 31 ( 13 ~; 6 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t118_zfmisc_1,axiom,
! [A,B,C] :
( subset(A,B)
=> ( subset(cartesian_product2(C,A),cartesian_product2(C,B))
& subset(cartesian_product2(A,C),cartesian_product2(B,C)) ) ),
file('theBenchmark.p',t118_zfmisc_1) ).
fof(t1_xboole_1,axiom,
! [A,B,C] :
( ( subset(B,C)
& subset(A,B) )
=> subset(A,C) ),
file('theBenchmark.p',t1_xboole_1) ).
fof(t119_zfmisc_1,conjecture,
! [A,B,C,D] :
( ( subset(C,D)
& subset(A,B) )
=> subset(cartesian_product2(A,C),cartesian_product2(B,D)) ),
file('theBenchmark.p',t119_zfmisc_1) ).
fof(t119_zfmisc_1_neg,negated_conjecture,
~ ! [A,B,C,D] :
( ( subset(C,D)
& subset(A,B) )
=> subset(cartesian_product2(A,C),cartesian_product2(B,D)) ),
inference(assume_negation,[status(cth)],[t119_zfmisc_1]) ).
cnf(c_7,plain,
( subset(cartesian_product2(A,C),cartesian_product2(B,C))
| ~ subset(A,B) ),
inference(clausify,[status(thm)],[t118_zfmisc_1]) ).
cnf(c_8,plain,
( subset(cartesian_product2(C,A),cartesian_product2(C,B))
| ~ subset(A,B) ),
inference(clausify,[status(thm)],[t118_zfmisc_1]) ).
cnf(c_9,plain,
( subset(A,C)
| ~ subset(B,C)
| ~ subset(A,B) ),
inference(clausify,[status(thm)],[t1_xboole_1]) ).
fof(nnf_5,plain,
? [A,B,C,D] :
( ~ subset(cartesian_product2(A,C),cartesian_product2(B,D))
& subset(C,D)
& subset(A,B) ),
inference(fof_nnf,[status(thm)],[t119_zfmisc_1_neg]) ).
fof(sk_t119_zfmisc_1_neg,plain,
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3))
& subset(sK2,sK3)
& subset(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(A,sK0),skolemize(B,sK1),skolemize(C,sK2),skolemize(D,sK3)],[nnf_5]) ).
cnf(c_10,negated_conjecture,
subset(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_t119_zfmisc_1_neg]) ).
cnf(c_11,negated_conjecture,
subset(sK2,sK3),
inference(split_conjunct,[status(thm)],[sk_t119_zfmisc_1_neg]) ).
cnf(c_12,negated_conjecture,
~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3)),
inference(split_conjunct,[status(thm)],[sk_t119_zfmisc_1_neg]) ).
cnf(c_14,negated_conjecture,
subset(cartesian_product2(sK0,A),cartesian_product2(sK1,A)),
inference(resolve,[status(thm)],[c_7,c_10]) ).
cnf(c_17,plain,
( ~ subset(A,cartesian_product2(sK1,sK3))
| ~ subset(cartesian_product2(sK0,sK2),A) ),
inference(resolve,[status(thm)],[c_12,c_9]) ).
cnf(c_21,plain,
( ~ subset(sK2,A)
| ~ subset(cartesian_product2(sK0,A),cartesian_product2(sK1,sK3)) ),
inference(resolve,[status(thm)],[c_17,c_8]) ).
cnf(c_27,plain,
~ subset(cartesian_product2(sK0,sK3),cartesian_product2(sK1,sK3)),
inference(resolve,[status(thm)],[c_21,c_11]) ).
cnf(c_28,plain,
$false,
inference(resolve,[status(thm)],[c_27,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU167+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 08:43:58 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 77966 was started by sandbox2 on n011,
% 0.09/0.36 % Sat Sep 26 08:43:58 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Theorem for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 14.
% 0.09/0.38 % Level of proof is 5.
% 0.09/0.38 % Maximum clause weight is 10.000.
% 0.09/0.38 % Given clauses 10.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------