TSTP Solution File: SWV365+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV365+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n018.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 : Thu Sep 29 15:11:30 EDT 2022
% Result : Theorem 0.11s 0.40s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV365+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.11/0.33 % Computer : n018.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun Sep 4 02:46:15 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.33 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.11/0.33 Usage: tptp [options] [-file:]file
% 0.11/0.33 -h, -? prints this message.
% 0.11/0.33 -smt2 print SMT-LIB2 benchmark.
% 0.11/0.33 -m, -model generate model.
% 0.11/0.33 -p, -proof generate proof.
% 0.11/0.33 -c, -core generate unsat core of named formulas.
% 0.11/0.33 -st, -statistics display statistics.
% 0.11/0.33 -t:timeout set timeout (in second).
% 0.11/0.33 -smt2status display status in smt2 format instead of SZS.
% 0.11/0.33 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.11/0.33 -<param>:<value> configuration parameter and value.
% 0.11/0.33 -o:<output-file> file to place output in.
% 0.11/0.40 % SZS status Theorem
% 0.11/0.40 % SZS output start Proof
% 0.11/0.40 tff(i_type, type, (
% 0.11/0.40 i: $i > $i)).
% 0.11/0.40 tff(triple_type, type, (
% 0.11/0.40 triple: ( $i * $i * $i ) > $i)).
% 0.11/0.40 tff(tptp_fun_Y_3_type, type, (
% 0.11/0.40 tptp_fun_Y_3: $i)).
% 0.11/0.40 tff(create_slb_type, type, (
% 0.11/0.40 create_slb: $i)).
% 0.11/0.40 tff(tptp_fun_V_5_type, type, (
% 0.11/0.40 tptp_fun_V_5: $i)).
% 0.11/0.40 tff(tptp_fun_X_4_type, type, (
% 0.11/0.40 tptp_fun_X_4: $i)).
% 0.11/0.40 tff(tptp_fun_U_6_type, type, (
% 0.11/0.40 tptp_fun_U_6: $i)).
% 0.11/0.40 tff(create_pq_type, type, (
% 0.11/0.40 create_pq: $i)).
% 0.11/0.40 tff(1,plain,
% 0.11/0.40 ((create_pq = i(triple(V!5, create_slb, Y!3))) <=> (i(triple(V!5, create_slb, Y!3)) = create_pq)),
% 0.11/0.40 inference(commutativity,[status(thm)],[])).
% 0.11/0.40 tff(2,plain,
% 0.11/0.40 (^[U: $i, V: $i] : refl((i(triple(U, create_slb, V)) = create_pq) <=> (i(triple(U, create_slb, V)) = create_pq))),
% 0.11/0.40 inference(bind,[status(th)],[])).
% 0.11/0.40 tff(3,plain,
% 0.11/0.40 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq) <=> ![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.11/0.40 inference(quant_intro,[status(thm)],[2])).
% 0.11/0.40 tff(4,plain,
% 0.11/0.40 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq) <=> ![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.11/0.40 inference(rewrite,[status(thm)],[])).
% 0.11/0.40 tff(5,axiom,(![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax','ax54')).
% 0.11/0.40 tff(6,plain,
% 0.11/0.40 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.11/0.40 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.11/0.40 tff(7,plain,(
% 0.11/0.40 ![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.11/0.40 inference(skolemize,[status(sab)],[6])).
% 0.11/0.40 tff(8,plain,
% 0.11/0.40 (![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)),
% 0.11/0.40 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.11/0.40 tff(9,plain,
% 0.11/0.40 ((~![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)) | (i(triple(U!6, create_slb, X!4)) = create_pq)),
% 0.11/0.40 inference(quant_inst,[status(thm)],[])).
% 0.11/0.40 tff(10,plain,
% 0.11/0.40 (i(triple(U!6, create_slb, X!4)) = create_pq),
% 0.11/0.40 inference(unit_resolution,[status(thm)],[9, 8])).
% 0.11/0.40 tff(11,plain,
% 0.11/0.40 ((i(triple(U!6, create_slb, X!4)) = i(triple(V!5, create_slb, Y!3))) <=> (create_pq = i(triple(V!5, create_slb, Y!3)))),
% 0.11/0.40 inference(monotonicity,[status(thm)],[10])).
% 0.11/0.40 tff(12,plain,
% 0.11/0.40 ((i(triple(U!6, create_slb, X!4)) = i(triple(V!5, create_slb, Y!3))) <=> (i(triple(V!5, create_slb, Y!3)) = create_pq)),
% 0.11/0.40 inference(transitivity,[status(thm)],[11, 1])).
% 0.11/0.40 tff(13,plain,
% 0.11/0.40 ((i(triple(V!5, create_slb, Y!3)) = create_pq) <=> (i(triple(U!6, create_slb, X!4)) = i(triple(V!5, create_slb, Y!3)))),
% 0.11/0.40 inference(symmetry,[status(thm)],[12])).
% 0.11/0.40 tff(14,plain,
% 0.11/0.40 ((~![U: $i, V: $i] : (i(triple(U, create_slb, V)) = create_pq)) | (i(triple(V!5, create_slb, Y!3)) = create_pq)),
% 0.11/0.40 inference(quant_inst,[status(thm)],[])).
% 0.11/0.40 tff(15,plain,
% 0.11/0.40 (i(triple(V!5, create_slb, Y!3)) = create_pq),
% 0.11/0.40 inference(unit_resolution,[status(thm)],[14, 8])).
% 0.11/0.40 tff(16,plain,
% 0.11/0.40 (i(triple(U!6, create_slb, X!4)) = i(triple(V!5, create_slb, Y!3))),
% 0.11/0.40 inference(modus_ponens,[status(thm)],[15, 13])).
% 0.11/0.40 tff(17,plain,
% 0.11/0.40 ((~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))) <=> (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y))))),
% 0.11/0.40 inference(rewrite,[status(thm)],[])).
% 0.11/0.40 tff(18,axiom,(~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','l1_co')).
% 0.11/0.40 tff(19,plain,
% 0.11/0.40 (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))),
% 0.11/0.40 inference(modus_ponens,[status(thm)],[18, 17])).
% 0.11/0.40 tff(20,plain,
% 0.11/0.40 (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))),
% 0.11/0.40 inference(modus_ponens,[status(thm)],[19, 17])).
% 0.11/0.40 tff(21,plain,
% 0.11/0.40 (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))),
% 0.11/0.40 inference(modus_ponens,[status(thm)],[20, 17])).
% 0.11/0.40 tff(22,plain,
% 0.11/0.40 (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))),
% 0.11/0.40 inference(modus_ponens,[status(thm)],[21, 17])).
% 0.18/0.40 tff(23,plain,
% 0.18/0.40 (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))),
% 0.18/0.40 inference(modus_ponens,[status(thm)],[22, 17])).
% 0.18/0.40 tff(24,plain,
% 0.18/0.40 (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))),
% 0.18/0.40 inference(modus_ponens,[status(thm)],[23, 17])).
% 0.18/0.40 tff(25,plain,
% 0.18/0.40 (~![U: $i, V: $i, X: $i, Y: $i] : (i(triple(U, create_slb, X)) = i(triple(V, create_slb, Y)))),
% 0.18/0.40 inference(modus_ponens,[status(thm)],[24, 17])).
% 0.18/0.40 tff(26,plain,(
% 0.18/0.40 ~(i(triple(U!6, create_slb, X!4)) = i(triple(V!5, create_slb, Y!3)))),
% 0.18/0.40 inference(skolemize,[status(sab)],[25])).
% 0.18/0.40 tff(27,plain,
% 0.18/0.40 ($false),
% 0.18/0.40 inference(unit_resolution,[status(thm)],[26, 16])).
% 0.18/0.40 % SZS output end Proof
%------------------------------------------------------------------------------