%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU165+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:16 AM UTC 2026
% Result : Theorem 0.08s 0.38s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 22 ~; 24 |; 9 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l55_zfmisc_1,axiom,
! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(B,D)
& in(A,C) ) ),
file('theBenchmark.p',l55_zfmisc_1) ).
fof(t106_zfmisc_1,conjecture,
! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(B,D)
& in(A,C) ) ),
file('theBenchmark.p',t106_zfmisc_1) ).
fof(t106_zfmisc_1_neg,negated_conjecture,
~ ! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(B,D)
& in(A,C) ) ),
inference(assume_negation,[status(cth)],[t106_zfmisc_1]) ).
cnf(c_15,plain,
( in(A,C)
| ~ in(ordered_pair(A,B),cartesian_product2(C,D)) ),
inference(clausify,[status(thm)],[l55_zfmisc_1]) ).
cnf(c_16,plain,
( in(B,D)
| ~ in(ordered_pair(A,B),cartesian_product2(C,D)) ),
inference(clausify,[status(thm)],[l55_zfmisc_1]) ).
cnf(c_17,plain,
( ~ in(B,D)
| ~ in(A,C)
| in(ordered_pair(A,B),cartesian_product2(C,D)) ),
inference(clausify,[status(thm)],[l55_zfmisc_1]) ).
fof(nnf_8,plain,
? [A,B,C,D] :
( ( ~ in(B,D)
| ~ in(A,C)
| ~ in(ordered_pair(A,B),cartesian_product2(C,D)) )
& ( ( in(B,D)
& in(A,C) )
| in(ordered_pair(A,B),cartesian_product2(C,D)) ) ),
inference(fof_nnf,[status(thm)],[t106_zfmisc_1_neg]) ).
fof(sk_t106_zfmisc_1_neg_sk,plain,
( ( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( ( in(sK1,sK3)
& in(sK0,sK2) )
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(A,sK0),skolemize(B,sK1),skolemize(C,sK2),skolemize(D,sK3)],[nnf_8]) ).
fof(sk_t106_zfmisc_1_neg,plain,
( ( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( in(sK1,sK3)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( in(sK0,sK2)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ) ),
inference(cnf_transformation,[status(thm)],[sk_t106_zfmisc_1_neg_sk]) ).
cnf(c_18,negated_conjecture,
( in(sK0,sK2)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(split_conjunct,[status(thm)],[sk_t106_zfmisc_1_neg]) ).
cnf(c_19,negated_conjecture,
( in(sK1,sK3)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(split_conjunct,[status(thm)],[sk_t106_zfmisc_1_neg]) ).
cnf(c_20,negated_conjecture,
( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(split_conjunct,[status(thm)],[sk_t106_zfmisc_1_neg]) ).
cnf(c_43,negated_conjecture,
( in(sK0,sK2)
| in(sK0,sK2) ),
inference(resolve,[status(thm)],[c_18,c_15]) ).
cnf(c_29,negated_conjecture,
in(sK0,sK2),
inference(copy,[status(thm)],[c_43]) ).
cnf(c_31,plain,
( ~ in(A,B)
| in(ordered_pair(sK0,A),cartesian_product2(sK2,B))
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(resolve,[status(thm)],[c_18,c_17]) ).
cnf(c_33,negated_conjecture,
( ~ in(sK1,sK3)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(resolve,[status(thm)],[c_29,c_20]) ).
cnf(c_34,plain,
( ~ in(sK1,sK3)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(factor,[status(thm)],[c_31]) ).
cnf(c_44,negated_conjecture,
( in(sK1,sK3)
| in(sK1,sK3) ),
inference(resolve,[status(thm)],[c_19,c_16]) ).
cnf(c_37,negated_conjecture,
in(sK1,sK3),
inference(copy,[status(thm)],[c_44]) ).
cnf(c_41,plain,
in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)),
inference(resolve,[status(thm)],[c_37,c_34]) ).
cnf(c_45,negated_conjecture,
~ in(sK1,sK3),
inference(resolve,[status(thm)],[c_41,c_33]) ).
cnf(c_42,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_37,c_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU165+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n020.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 08:44:03 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 1123196 was started by sandbox2 on n020,
% 0.08/0.36 % Sat Sep 26 08:44:03 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 0.08/0.38
% 0.08/0.38 % SZS status Theorem for theBenchmark
% 0.08/0.38
% 0.08/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.38 % Length of proof is 15.
% 0.08/0.38 % Level of proof is 5.
% 0.08/0.38 % Maximum clause weight is 27.000.
% 0.08/0.38 % Given clauses 11.
% 0.08/0.38
% 0.08/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------