%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SET575+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 : Tue Sep 29 12:38:48 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Proof 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET575+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 02:12:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.45 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.10/0.45
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45
% 0.10/0.45 % SZS output start Proof
% 0.10/0.45 Axiom 1 (prove_th15): intersect(b, c) = true.
% 0.10/0.45 Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.10/0.45 Axiom 3 (intersect_defn): ifeq(intersect(X, Y), true, member(d(X, Y), X), true) = true.
% 0.10/0.45 Axiom 4 (intersect_defn_1): ifeq(intersect(X, Y), true, member(d(X, Y), Y), true) = true.
% 0.10/0.45
% 0.10/0.45 Goal 1 (prove_th15_1): tuple(member(X, b), member(X, c)) = tuple(true, true).
% 0.10/0.45 The goal is true when:
% 0.10/0.45 X = d(b, c)
% 0.10/0.45
% 0.10/0.45 Proof:
% 0.10/0.45 tuple(member(d(b, c), b), member(d(b, c), c))
% 0.10/0.45 = { by axiom 2 (ifeq_axiom) R->L }
% 0.10/0.45 tuple(member(d(b, c), b), ifeq(true, true, member(d(b, c), c), true))
% 0.10/0.45 = { by axiom 1 (prove_th15) R->L }
% 0.10/0.45 tuple(member(d(b, c), b), ifeq(intersect(b, c), true, member(d(b, c), c), true))
% 0.10/0.45 = { by axiom 4 (intersect_defn_1) }
% 0.10/0.45 tuple(member(d(b, c), b), true)
% 0.10/0.45 = { by axiom 2 (ifeq_axiom) R->L }
% 0.10/0.45 tuple(ifeq(true, true, member(d(b, c), b), true), true)
% 0.10/0.45 = { by axiom 1 (prove_th15) R->L }
% 0.10/0.45 tuple(ifeq(intersect(b, c), true, member(d(b, c), b), true), true)
% 0.10/0.45 = { by axiom 3 (intersect_defn) }
% 0.10/0.45 tuple(true, true)
% 0.10/0.45 % SZS output end Proof
% 0.10/0.45
% 0.10/0.45 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------