%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU124+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 : 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:04 AM UTC 2026
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 44 ( 2 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 45 ( 19 ~; 16 |; 6 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn 24 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_xboole_0,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
| in(D,A) ) ) ),
file('theBenchmark.p',d2_xboole_0) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_tarski) ).
fof(t7_xboole_1,conjecture,
! [A,B] : subset(A,set_union2(A,B)),
file('theBenchmark.p',t7_xboole_1) ).
fof(t7_xboole_1_neg,negated_conjecture,
~ ! [A,B] : subset(A,set_union2(A,B)),
inference(assume_negation,[status(cth)],[t7_xboole_1]) ).
cnf(c_21,plain,
( ~ in(D,A)
| in(D,C)
| set_union2(A,B) != C ),
inference(clausify,[status(thm)],[d2_xboole_0]) ).
fof(nnf_4,plain,
! [A,B] :
( ( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ( ! [X0] :
( in(X0,B)
| ~ in(X0,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[d3_tarski]) ).
fof(sk_d3_tarski_sk,plain,
! [A,B] :
( ( ( ~ in(sK0(A,B),B)
& in(sK0(A,B),A) )
| subset(A,B) )
& ( ! [X0] :
( in(X0,B)
| ~ in(X0,A) )
| ~ subset(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(C,sK0(A,B))],[nnf_4]) ).
fof(sk_d3_tarski,plain,
( ! [VAR_0,VAR_1] :
( ~ in(sK0(VAR_0,VAR_1),VAR_1)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( in(sK0(VAR_0,VAR_1),VAR_0)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1,VAR_2] :
( in(VAR_2,VAR_1)
| ~ in(VAR_2,VAR_0)
| ~ subset(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_d3_tarski_sk]) ).
cnf(c_27,plain,
( in(sK0(A,B),A)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_d3_tarski]) ).
cnf(c_28,plain,
( ~ in(sK0(A,B),B)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_d3_tarski]) ).
fof(nnf_17,plain,
? [A,B] : ~ subset(A,set_union2(A,B)),
inference(fof_nnf,[status(thm)],[t7_xboole_1_neg]) ).
fof(sk_t7_xboole_1_neg,plain,
~ subset(sK1,set_union2(sK1,sK2)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(A,sK1),skolemize(B,sK2)],[nnf_17]) ).
cnf(c_40,negated_conjecture,
~ subset(sK1,set_union2(sK1,sK2)),
inference(split_conjunct,[status(thm)],[sk_t7_xboole_1_neg]) ).
cnf(c_50,plain,
( ~ in(A,B)
| in(A,set_union2(B,C)) ),
inference(xxres,[status(thm)],[c_21]) ).
cnf(c_162,plain,
in(sK0(sK1,set_union2(sK1,sK2)),sK1),
inference(resolve,[status(thm)],[c_40,c_27]) ).
cnf(c_163,negated_conjecture,
~ in(sK0(sK1,set_union2(sK1,sK2)),set_union2(sK1,sK2)),
inference(resolve,[status(thm)],[c_28,c_40]) ).
cnf(c_323,plain,
~ in(sK0(sK1,set_union2(sK1,sK2)),sK1),
inference(resolve,[status(thm)],[c_50,c_163]) ).
cnf(c_322,plain,
$false,
inference(resolve,[status(thm)],[c_162,c_323]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU124+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.43 % Computer : n020.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 08:38:33 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 1106586 was started by sandbox on n020,
% 0.16/0.44 % Sat Sep 26 08:38:33 2026
% 0.16/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.45
% 0.16/0.45 % From the command line: assign(max_seconds, 300).
% 0.22/0.55
% 0.22/0.55 % SZS status Theorem for theBenchmark
% 0.22/0.55
% 0.22/0.55 % Proof 1 at 0.06 (+ 0.03) seconds.
% 0.22/0.55 % Length of proof is 11.
% 0.22/0.55 % Level of proof is 3.
% 0.22/0.55 % Maximum clause weight is 24.000.
% 0.22/0.55 % Given clauses 47.
% 0.22/0.55
% 0.22/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------