TSTP Solution File: REL049+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n015.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 : Tue Sep 20 03:00:23 EDT 2022
% Result : Theorem 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : REL049+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Sep 2 21:18:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.33 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.33 Usage: tptp [options] [-file:]file
% 0.13/0.33 -h, -? prints this message.
% 0.13/0.33 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.33 -m, -model generate model.
% 0.13/0.33 -p, -proof generate proof.
% 0.13/0.33 -c, -core generate unsat core of named formulas.
% 0.13/0.33 -st, -statistics display statistics.
% 0.13/0.33 -t:timeout set timeout (in second).
% 0.13/0.33 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.33 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.33 -<param>:<value> configuration parameter and value.
% 0.13/0.33 -o:<output-file> file to place output in.
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 % SZS output start Proof
% 0.13/0.36 tff(tptp_fun_X1_1_type, type, (
% 0.13/0.36 tptp_fun_X1_1: $i)).
% 0.13/0.36 tff(join_type, type, (
% 0.13/0.36 join: ( $i * $i ) > $i)).
% 0.13/0.36 tff(tptp_fun_X2_0_type, type, (
% 0.13/0.36 tptp_fun_X2_0: $i)).
% 0.13/0.36 tff(tptp_fun_X0_2_type, type, (
% 0.13/0.36 tptp_fun_X0_2: $i)).
% 0.13/0.36 tff(1,plain,
% 0.13/0.36 ((~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))) <=> (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1)))),
% 0.13/0.36 inference(rewrite,[status(thm)],[])).
% 0.13/0.36 tff(2,plain,
% 0.13/0.36 ((~![X0: $i, X1: $i, X2: $i] : (((join(X0, X1) = X1) & (join(X2, X1) = X1)) => (join(join(X0, X2), X1) = X1))) <=> (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1)))),
% 0.13/0.36 inference(rewrite,[status(thm)],[])).
% 0.13/0.36 tff(3,axiom,(~![X0: $i, X1: $i, X2: $i] : (((join(X0, X1) = X1) & (join(X2, X1) = X1)) => (join(join(X0, X2), X1) = X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','goals')).
% 0.13/0.36 tff(4,plain,
% 0.13/0.36 (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[3, 2])).
% 0.13/0.36 tff(5,plain,
% 0.13/0.36 (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[4, 1])).
% 0.13/0.36 tff(6,plain,
% 0.13/0.36 (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[5, 1])).
% 0.13/0.36 tff(7,plain,
% 0.13/0.36 (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[6, 1])).
% 0.13/0.36 tff(8,plain,
% 0.13/0.36 (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[7, 1])).
% 0.13/0.36 tff(9,plain,
% 0.13/0.36 (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[8, 1])).
% 0.13/0.36 tff(10,plain,
% 0.13/0.36 (~![X0: $i, X1: $i, X2: $i] : ((~((join(X0, X1) = X1) & (join(X2, X1) = X1))) | (join(join(X0, X2), X1) = X1))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[9, 1])).
% 0.13/0.36 tff(11,plain,(
% 0.13/0.36 ~((~((join(X0!2, X1!1) = X1!1) & (join(X2!0, X1!1) = X1!1))) | (join(join(X0!2, X2!0), X1!1) = X1!1))),
% 0.13/0.36 inference(skolemize,[status(sab)],[10])).
% 0.13/0.36 tff(12,plain,
% 0.13/0.36 ((join(X0!2, X1!1) = X1!1) & (join(X2!0, X1!1) = X1!1)),
% 0.13/0.36 inference(or_elim,[status(thm)],[11])).
% 0.13/0.36 tff(13,plain,
% 0.13/0.36 (join(X0!2, X1!1) = X1!1),
% 0.13/0.36 inference(and_elim,[status(thm)],[12])).
% 0.13/0.36 tff(14,plain,
% 0.13/0.36 (join(X2!0, X1!1) = X1!1),
% 0.13/0.36 inference(and_elim,[status(thm)],[12])).
% 0.13/0.36 tff(15,plain,
% 0.13/0.36 (join(X0!2, join(X2!0, X1!1)) = join(X0!2, X1!1)),
% 0.13/0.36 inference(monotonicity,[status(thm)],[14])).
% 0.13/0.36 tff(16,plain,
% 0.13/0.36 (^[X0: $i, X1: $i, X2: $i] : refl((join(X0, join(X1, X2)) = join(join(X0, X1), X2)) <=> (join(X0, join(X1, X2)) = join(join(X0, X1), X2)))),
% 0.13/0.36 inference(bind,[status(th)],[])).
% 0.13/0.36 tff(17,plain,
% 0.13/0.36 (![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2)) <=> ![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2))),
% 0.13/0.36 inference(quant_intro,[status(thm)],[16])).
% 0.13/0.36 tff(18,plain,
% 0.13/0.36 (![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2)) <=> ![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2))),
% 0.13/0.36 inference(rewrite,[status(thm)],[])).
% 0.13/0.36 tff(19,axiom,(![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2))), file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax','maddux2_join_associativity')).
% 0.13/0.36 tff(20,plain,
% 0.13/0.36 (![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[19, 18])).
% 0.13/0.36 tff(21,plain,(
% 0.13/0.36 ![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2))),
% 0.13/0.36 inference(skolemize,[status(sab)],[20])).
% 0.13/0.36 tff(22,plain,
% 0.13/0.36 (![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2))),
% 0.13/0.36 inference(modus_ponens,[status(thm)],[21, 17])).
% 0.13/0.36 tff(23,plain,
% 0.13/0.36 ((~![X0: $i, X1: $i, X2: $i] : (join(X0, join(X1, X2)) = join(join(X0, X1), X2))) | (join(X0!2, join(X2!0, X1!1)) = join(join(X0!2, X2!0), X1!1))),
% 0.13/0.36 inference(quant_inst,[status(thm)],[])).
% 0.13/0.36 tff(24,plain,
% 0.13/0.36 (join(X0!2, join(X2!0, X1!1)) = join(join(X0!2, X2!0), X1!1)),
% 0.13/0.36 inference(unit_resolution,[status(thm)],[23, 22])).
% 0.13/0.36 tff(25,plain,
% 0.13/0.36 (join(join(X0!2, X2!0), X1!1) = join(X0!2, join(X2!0, X1!1))),
% 0.13/0.36 inference(symmetry,[status(thm)],[24])).
% 0.13/0.36 tff(26,plain,
% 0.13/0.36 (join(join(X0!2, X2!0), X1!1) = X1!1),
% 0.13/0.36 inference(transitivity,[status(thm)],[25, 15, 13])).
% 0.13/0.36 tff(27,plain,
% 0.13/0.36 (~(join(join(X0!2, X2!0), X1!1) = X1!1)),
% 0.13/0.36 inference(or_elim,[status(thm)],[11])).
% 0.13/0.36 tff(28,plain,
% 0.13/0.36 ($false),
% 0.13/0.36 inference(unit_resolution,[status(thm)],[27, 26])).
% 0.13/0.36 % SZS output end Proof
%------------------------------------------------------------------------------