%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET599+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n002.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 : Fri Sep 25 02:43:33 PM UTC 2026
% Result : Theorem 2.46s 0.77s
% Output : Proof 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 15 unt; 0 def)
% Number of atoms : 15 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 1 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,axiom,
! [B,C] : symmetric_difference(B,C) = union(difference(B,C),difference(C,B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).
fof(f0_nnf,plain,
! [B,C] : symmetric_difference(B,C) = union(difference(B,C),difference(C,B)),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [B,C] : symmetric_difference(B,C) = union(difference(B,C),difference(C,B)),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
fof(f1,axiom,
! [B,C] : subset(B,union(B,C)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union) ).
fof(f1_nnf,plain,
! [B,C] : subset(B,union(B,C)),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [B,C] : subset(B,union(B,C)),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
subset(X0,union(X0,X1)),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p18,plain,
subset(difference(X0,X1),symmetric_difference(X0,X1)),
inference(superposition,[status(thm)],[c0,c1]) ).
fof(f8,conjecture,
! [B,C] : subset(difference(B,C),symmetric_difference(B,C)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th58) ).
fof(f8_neg,negated_conjecture,
~ ! [B,C] : subset(difference(B,C),symmetric_difference(B,C)),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f8_nnf,plain,
? [B,C] : ~ subset(difference(B,C),symmetric_difference(B,C)),
inference(nnf_transformation,[status(thm)],[f8_neg]) ).
fof(f8_sk,plain,
~ subset(difference(sk2,sk3),symmetric_difference(sk2,sk3)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f8_nnf]) ).
cnf(c17,plain,
~ subset(difference(sk2,sk3),symmetric_difference(sk2,sk3)),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(p36,plain,
$false,
inference(resolution,[status(thm)],[p18,c17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET599+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.35 % Computer : n002.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Thu Sep 24 11:27:03 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.46/0.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.46/0.77 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------