%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU134+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 : n016.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:07 AM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 31 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 29 ( 14 ~; 10 |; 2 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l32_xboole_1,axiom,
! [A,B] :
( set_difference(A,B) = empty_set
<=> subset(A,B) ),
file('theBenchmark.p',l32_xboole_1) ).
fof(t37_xboole_1,conjecture,
! [A,B] :
( set_difference(A,B) = empty_set
<=> subset(A,B) ),
file('theBenchmark.p',t37_xboole_1) ).
fof(t37_xboole_1_neg,negated_conjecture,
~ ! [A,B] :
( set_difference(A,B) = empty_set
<=> subset(A,B) ),
inference(assume_negation,[status(cth)],[t37_xboole_1]) ).
cnf(c_24,plain,
( subset(A,B)
| set_difference(A,B) != empty_set ),
inference(clausify,[status(thm)],[l32_xboole_1]) ).
cnf(c_25,plain,
( ~ subset(A,B)
| set_difference(A,B) = empty_set ),
inference(clausify,[status(thm)],[l32_xboole_1]) ).
fof(nnf_13,plain,
? [A,B] :
( ( ~ subset(A,B)
| set_difference(A,B) != empty_set )
& ( subset(A,B)
| set_difference(A,B) = empty_set ) ),
inference(fof_nnf,[status(thm)],[t37_xboole_1_neg]) ).
fof(sk_t37_xboole_1_neg,plain,
( ( ~ subset(sK0,sK1)
| set_difference(sK0,sK1) != empty_set )
& ( subset(sK0,sK1)
| set_difference(sK0,sK1) = empty_set ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK0),skolemize(B,sK1)],[nnf_13]) ).
cnf(c_26,negated_conjecture,
( subset(sK0,sK1)
| set_difference(sK0,sK1) = empty_set ),
inference(split_conjunct,[status(thm)],[sk_t37_xboole_1_neg]) ).
cnf(c_27,negated_conjecture,
( ~ subset(sK0,sK1)
| set_difference(sK0,sK1) != empty_set ),
inference(split_conjunct,[status(thm)],[sk_t37_xboole_1_neg]) ).
cnf(c_39,negated_conjecture,
( set_difference(sK0,sK1) = empty_set
| set_difference(sK0,sK1) = empty_set ),
inference(resolve,[status(thm)],[c_26,c_25]) ).
cnf(c_36,negated_conjecture,
set_difference(sK0,sK1) = empty_set,
inference(copy,[status(thm)],[c_39]) ).
cnf(c_40,negated_conjecture,
( ~ subset(sK0,sK1)
| empty_set != empty_set ),
inference(paramod,[status(thm)],[c_36,c_27]) ).
cnf(c_37,negated_conjecture,
~ subset(sK0,sK1),
inference(copy,[status(thm)],[c_40]) ).
cnf(c_41,negated_conjecture,
set_difference(sK0,sK1) != empty_set,
inference(resolve,[status(thm)],[c_24,c_37]) ).
cnf(c_42,negated_conjecture,
empty_set != empty_set,
inference(paramod,[status(thm)],[c_36,c_41]) ).
cnf(c_38,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU134+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n016.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sat Sep 26 08:43:29 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 450497 was started by sandbox2 on n016,
% 0.17/0.44 % Sat Sep 26 08:43:29 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.46
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46
% 0.17/0.46 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.46 % Length of proof is 9.
% 0.17/0.46 % Level of proof is 4.
% 0.17/0.46 % Maximum clause weight is 8.000.
% 0.17/0.46 % Given clauses 16.
% 0.17/0.46
% 0.17/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------