↑ Up

Z3---4.15.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SET583+3 : TPTP v9.0.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat Jun 21 05:25:54 AM UTC 2025

% Result   : Theorem 0.19s 0.37s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET583+3 : TPTP v9.0.0. Released v2.2.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n008.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Fri Jun 20 05:29:03 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 0.19/0.37  % SZS status Theorem
% 0.19/0.37  % SZS output start Proof
% 0.19/0.37  tff(tptp_fun_C_1_type, type, (
% 0.19/0.37     tptp_fun_C_1: $i)).
% 0.19/0.37  tff(tptp_fun_B_2_type, type, (
% 0.19/0.37     tptp_fun_B_2: $i)).
% 0.19/0.37  tff(subset_type, type, (
% 0.19/0.37     subset: ( $i * $i ) > $o)).
% 0.19/0.37  tff(1,plain,
% 0.19/0.37      ((~![B: $i, C: $i] : ((~(subset(B, C) & subset(C, B))) | (B = C))) <=> (~![B: $i, C: $i] : ((~(subset(B, C) & subset(C, B))) | (B = C)))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(2,plain,
% 0.19/0.37      ((~![B: $i, C: $i] : ((subset(B, C) & subset(C, B)) => (B = C))) <=> (~![B: $i, C: $i] : ((~(subset(B, C) & subset(C, B))) | (B = C)))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(3,axiom,(~![B: $i, C: $i] : ((subset(B, C) & subset(C, B)) => (B = C))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_extensionality')).
% 0.19/0.37  tff(4,plain,
% 0.19/0.37      (~![B: $i, C: $i] : ((~(subset(B, C) & subset(C, B))) | (B = C))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[3, 2])).
% 0.19/0.37  tff(5,plain,
% 0.19/0.37      (~![B: $i, C: $i] : ((~(subset(B, C) & subset(C, B))) | (B = C))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[4, 1])).
% 0.19/0.37  tff(6,plain,
% 0.19/0.37      (~![B: $i, C: $i] : ((~(subset(B, C) & subset(C, B))) | (B = C))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[5, 1])).
% 0.19/0.37  tff(7,plain,
% 0.19/0.37      (~![B: $i, C: $i] : ((~(subset(B, C) & subset(C, B))) | (B = C))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[6, 1])).
% 0.19/0.37  tff(8,plain,(
% 0.19/0.37      ~((~(subset(B!2, C!1) & subset(C!1, B!2))) | (B!2 = C!1))),
% 0.19/0.37      inference(skolemize,[status(sab)],[7])).
% 0.19/0.37  tff(9,plain,
% 0.19/0.37      (subset(B!2, C!1) & subset(C!1, B!2)),
% 0.19/0.37      inference(or_elim,[status(thm)],[8])).
% 0.19/0.37  tff(10,plain,
% 0.19/0.37      (subset(C!1, B!2)),
% 0.19/0.37      inference(and_elim,[status(thm)],[9])).
% 0.19/0.37  tff(11,plain,
% 0.19/0.37      (subset(B!2, C!1)),
% 0.19/0.37      inference(and_elim,[status(thm)],[9])).
% 0.19/0.37  tff(12,plain,
% 0.19/0.37      ((~((~subset(B!2, C!1)) | (~subset(C!1, B!2)))) | (~subset(B!2, C!1)) | (~subset(C!1, B!2))),
% 0.19/0.37      inference(tautology,[status(thm)],[])).
% 0.19/0.37  tff(13,plain,
% 0.19/0.37      (~((~subset(B!2, C!1)) | (~subset(C!1, B!2)))),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[12, 11, 10])).
% 0.19/0.37  tff(14,plain,
% 0.19/0.37      (~(B!2 = C!1)),
% 0.19/0.37      inference(or_elim,[status(thm)],[8])).
% 0.19/0.37  tff(15,plain,
% 0.19/0.37      ((((~subset(B!2, C!1)) | (~subset(C!1, B!2))) <=> (B!2 = C!1)) | ((~subset(B!2, C!1)) | (~subset(C!1, B!2))) | (B!2 = C!1)),
% 0.19/0.37      inference(tautology,[status(thm)],[])).
% 0.19/0.37  tff(16,plain,
% 0.19/0.37      (((~subset(B!2, C!1)) | (~subset(C!1, B!2))) <=> (B!2 = C!1)),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[15, 14, 13])).
% 0.19/0.37  tff(17,plain,
% 0.19/0.37      (^[B: $i, C: $i] : refl((~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C))) <=> (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C))))),
% 0.19/0.37      inference(bind,[status(th)],[])).
% 0.19/0.37  tff(18,plain,
% 0.19/0.37      (![B: $i, C: $i] : (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C))) <=> ![B: $i, C: $i] : (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))),
% 0.19/0.37      inference(quant_intro,[status(thm)],[17])).
% 0.19/0.37  tff(19,plain,
% 0.19/0.37      (^[B: $i, C: $i] : trans(trans(monotonicity(rewrite((subset(B, C) & subset(C, B)) <=> (~((~subset(B, C)) | (~subset(C, B))))), (((B = C) <=> (subset(B, C) & subset(C, B))) <=> ((B = C) <=> (~((~subset(B, C)) | (~subset(C, B))))))), rewrite(((B = C) <=> (~((~subset(B, C)) | (~subset(C, B))))) <=> (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))), (((B = C) <=> (subset(B, C) & subset(C, B))) <=> (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C))))), rewrite((~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C))) <=> (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))), (((B = C) <=> (subset(B, C) & subset(C, B))) <=> (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))))),
% 0.19/0.37      inference(bind,[status(th)],[])).
% 0.19/0.37  tff(20,plain,
% 0.19/0.37      (![B: $i, C: $i] : ((B = C) <=> (subset(B, C) & subset(C, B))) <=> ![B: $i, C: $i] : (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))),
% 0.19/0.37      inference(quant_intro,[status(thm)],[19])).
% 0.19/0.37  tff(21,plain,
% 0.19/0.37      (![B: $i, C: $i] : ((B = C) <=> (subset(B, C) & subset(C, B))) <=> ![B: $i, C: $i] : ((B = C) <=> (subset(B, C) & subset(C, B)))),
% 0.19/0.37      inference(rewrite,[status(thm)],[])).
% 0.19/0.37  tff(22,axiom,(![B: $i, C: $i] : ((B = C) <=> (subset(B, C) & subset(C, B)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','equal_defn')).
% 0.19/0.37  tff(23,plain,
% 0.19/0.37      (![B: $i, C: $i] : ((B = C) <=> (subset(B, C) & subset(C, B)))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[22, 21])).
% 0.19/0.37  tff(24,plain,(
% 0.19/0.37      ![B: $i, C: $i] : ((B = C) <=> (subset(B, C) & subset(C, B)))),
% 0.19/0.37      inference(skolemize,[status(sab)],[23])).
% 0.19/0.37  tff(25,plain,
% 0.19/0.37      (![B: $i, C: $i] : (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[24, 20])).
% 0.19/0.37  tff(26,plain,
% 0.19/0.37      (![B: $i, C: $i] : (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))),
% 0.19/0.37      inference(modus_ponens,[status(thm)],[25, 18])).
% 0.19/0.37  tff(27,plain,
% 0.19/0.37      ((~![B: $i, C: $i] : (~(((~subset(B, C)) | (~subset(C, B))) <=> (B = C)))) | (~(((~subset(B!2, C!1)) | (~subset(C!1, B!2))) <=> (B!2 = C!1)))),
% 0.19/0.37      inference(quant_inst,[status(thm)],[])).
% 0.19/0.37  tff(28,plain,
% 0.19/0.37      ($false),
% 0.19/0.37      inference(unit_resolution,[status(thm)],[27, 26, 16])).
% 0.19/0.37  % SZS output end Proof
% 0.19/0.37  % E exiting
%------------------------------------------------------------------------------