%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SET940+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n026.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:44:20 PM UTC 2026
% Result : Theorem 0.65s 0.90s
% Output : Proof 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 14 ( 14 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 38 ( 2 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A,B] : set_union2(A,B) = set_union2(B,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f3_nnf,plain,
! [A,B] : set_union2(A,B) = set_union2(B,A),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [A,B] : set_union2(A,B) = set_union2(B,A),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(t3,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t21,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(orient,[status(thm)],[t3]) ).
fof(f8,axiom,
! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l52_zfmisc_1) ).
fof(f8_nnf,plain,
! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
union(unordered_pair(X0,X1)) = set_union2(X0,X1),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(t6,plain,
union(unordered_pair(X1,X2)) = set_union2(X1,X2),
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(t23,plain,
union(unordered_pair(X1,X2)) = set_union2(X1,X2),
inference(orient,[status(thm)],[t6]) ).
cnf(t2,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t11,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t2]) ).
fof(f6,axiom,
? [A] : ~ empty(A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(f6_nnf,plain,
? [A] : ~ empty(A),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
~ empty(sk1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f6_nnf]) ).
cnf(c6,plain,
~ empty(sk1),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
fof(f7,conjecture,
! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t93_zfmisc_1) ).
fof(f7_neg,negated_conjecture,
~ ! [A,B] : union(unordered_pair(A,B)) = set_union2(A,B),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f7_nnf,plain,
? [A,B] : union(unordered_pair(A,B)) != set_union2(A,B),
inference(nnf_transformation,[status(thm)],[f7_neg]) ).
fof(f7_sk,plain,
union(unordered_pair(sk2,sk3)) != set_union2(sk2,sk3),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f7_nnf]) ).
cnf(c7,plain,
union(unordered_pair(sk2,sk3)) != set_union2(sk2,sk3),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c6,c7]) ).
cnf(g0_0,plain,
true != ifeq(union(unordered_pair(sk2,sk3)),set_union2(sk2,sk3),false,true),
inference(rw,[status(thm)],[goal_0]) ).
cnf(g0_1,plain,
true != ifeq(union(unordered_pair(sk2,sk3)),set_union2(sk3,sk2),false,true),
inference(rw,[status(thm)],[g0_0,t21]) ).
cnf(g0_2,plain,
true != ifeq(set_union2(sk2,sk3),set_union2(sk3,sk2),false,true),
inference(rw,[status(thm)],[g0_1,t23]) ).
cnf(g0_3,plain,
true != ifeq(set_union2(sk3,sk2),set_union2(sk3,sk2),false,true),
inference(rw,[status(thm)],[g0_2,t21]) ).
cnf(g0_4,plain,
true != false,
inference(rw,[status(thm)],[g0_3,t11]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET940+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n026.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 : Thu Sep 24 12:27:54 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.65/0.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.65/0.90 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------