TSTP Solution File: SWC365+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n021.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 11:57:26 EDT 2022
% Result : Theorem 0.21s 0.48s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC365+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun Sep 4 00:21:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.48 % SZS status Theorem
% 0.21/0.48 % SZS output start Proof
% 0.21/0.48 tff(neq_type, type, (
% 0.21/0.48 neq: ( $i * $i ) > $o)).
% 0.21/0.48 tff(nil_type, type, (
% 0.21/0.48 nil: $i)).
% 0.21/0.48 tff(tptp_fun_X_50_type, type, (
% 0.21/0.48 tptp_fun_X_50: $i)).
% 0.21/0.48 tff(tptp_fun_V_48_type, type, (
% 0.21/0.48 tptp_fun_V_48: $i)).
% 0.21/0.48 tff(ssList_type, type, (
% 0.21/0.48 ssList: $i > $o)).
% 0.21/0.48 tff(tptp_fun_W_49_type, type, (
% 0.21/0.48 tptp_fun_W_49: $i)).
% 0.21/0.48 tff(rearsegP_type, type, (
% 0.21/0.48 rearsegP: ( $i * $i ) > $o)).
% 0.21/0.48 tff(tptp_fun_U_47_type, type, (
% 0.21/0.48 tptp_fun_U_47: $i)).
% 0.21/0.48 tff(1,plain,
% 0.21/0.48 ((ssList(U!47) & (ssList(V!48) & ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))))) <=> (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))))),
% 0.21/0.48 inference(rewrite,[status(thm)],[])).
% 0.21/0.48 tff(2,plain,
% 0.21/0.48 ((ssList(V!48) & (ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))))) <=> (ssList(V!48) & ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))))),
% 0.21/0.48 inference(rewrite,[status(thm)],[])).
% 0.21/0.48 tff(3,plain,
% 0.21/0.48 (((~(~ssList(W!49))) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50))))) <=> (ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))))),
% 0.21/0.48 inference(rewrite,[status(thm)],[])).
% 0.21/0.48 tff(4,plain,
% 0.21/0.48 ((~(~ssList(V!48))) <=> ssList(V!48)),
% 0.21/0.48 inference(rewrite,[status(thm)],[])).
% 0.21/0.48 tff(5,plain,
% 0.21/0.48 (((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)))))) <=> (ssList(V!48) & (ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50))))))),
% 0.21/0.48 inference(monotonicity,[status(thm)],[4, 3])).
% 0.21/0.48 tff(6,plain,
% 0.21/0.48 (((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)))))) <=> (ssList(V!48) & ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))))),
% 0.21/0.48 inference(transitivity,[status(thm)],[5, 2])).
% 0.21/0.48 tff(7,plain,
% 0.21/0.48 ((~(~ssList(U!47))) <=> ssList(U!47)),
% 0.21/0.48 inference(rewrite,[status(thm)],[])).
% 0.21/0.48 tff(8,plain,
% 0.21/0.48 (((~(~ssList(U!47))) & ((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50))))))) <=> (ssList(U!47) & (ssList(V!48) & ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50))))))),
% 0.21/0.48 inference(monotonicity,[status(thm)],[7, 6])).
% 0.21/0.48 tff(9,plain,
% 0.21/0.48 (((~(~ssList(U!47))) & ((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50))))))) <=> (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))))),
% 0.21/0.48 inference(transitivity,[status(thm)],[8, 1])).
% 0.21/0.48 tff(10,plain,
% 0.21/0.48 ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X)))))))),
% 0.21/0.48 inference(rewrite,[status(thm)],[])).
% 0.21/0.48 tff(11,plain,
% 0.21/0.48 ((~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => ((((((~(V = X)) | (~(U = W))) | (~neq(V, nil))) | rearsegP(V, U)) | ((~(nil = W)) & (nil = X))) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X)))))))),
% 0.21/0.48 inference(rewrite,[status(thm)],[])).
% 0.21/0.48 tff(12,axiom,(~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => ((((((~(V = X)) | (~(U = W))) | (~neq(V, nil))) | rearsegP(V, U)) | ((~(nil = W)) & (nil = X))) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','co1')).
% 0.21/0.48 tff(13,plain,
% 0.21/0.48 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))),
% 0.21/0.48 inference(modus_ponens,[status(thm)],[12, 11])).
% 0.21/0.48 tff(14,plain,
% 0.21/0.48 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))),
% 0.21/0.48 inference(modus_ponens,[status(thm)],[13, 10])).
% 0.21/0.48 tff(15,plain,
% 0.21/0.48 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))),
% 0.21/0.48 inference(modus_ponens,[status(thm)],[14, 10])).
% 0.21/0.48 tff(16,plain,
% 0.21/0.48 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))),
% 0.21/0.48 inference(modus_ponens,[status(thm)],[15, 10])).
% 0.21/0.48 tff(17,plain,
% 0.21/0.48 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))),
% 0.21/0.48 inference(modus_ponens,[status(thm)],[16, 10])).
% 0.21/0.48 tff(18,plain,
% 0.21/0.48 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))),
% 0.21/0.48 inference(modus_ponens,[status(thm)],[17, 10])).
% 0.21/0.48 tff(19,plain,
% 0.21/0.48 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : (rearsegP(V, U) | (~neq(V, nil)) | (neq(X, nil) & ((~neq(W, nil)) | (~rearsegP(X, W)))) | ((~(nil = W)) & (nil = X)) | (~(U = W)) | (~(V = X)) | (~ssList(X))))))),
% 0.21/0.49 inference(modus_ponens,[status(thm)],[18, 10])).
% 0.21/0.49 tff(20,plain,
% 0.21/0.49 (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50))))),
% 0.21/0.49 inference(modus_ponens,[status(thm)],[19, 9])).
% 0.21/0.49 tff(21,plain,
% 0.21/0.49 (~(rearsegP(V!48, U!47) | (~neq(V!48, nil)) | (~(U!47 = W!49)) | (neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) | ((~(nil = W!49)) & (nil = X!50)) | (~(V!48 = X!50)) | (~ssList(X!50)))),
% 0.21/0.49 inference(and_elim,[status(thm)],[20])).
% 0.21/0.49 tff(22,plain,
% 0.21/0.49 (V!48 = X!50),
% 0.21/0.49 inference(or_elim,[status(thm)],[21])).
% 0.21/0.49 tff(23,plain,
% 0.21/0.49 (neq(V!48, nil) <=> neq(X!50, nil)),
% 0.21/0.49 inference(monotonicity,[status(thm)],[22])).
% 0.21/0.49 tff(24,plain,
% 0.21/0.49 (neq(V!48, nil)),
% 0.21/0.49 inference(or_elim,[status(thm)],[21])).
% 0.21/0.49 tff(25,plain,
% 0.21/0.49 (neq(X!50, nil)),
% 0.21/0.49 inference(modus_ponens,[status(thm)],[24, 23])).
% 0.21/0.49 tff(26,plain,
% 0.21/0.49 (U!47 = W!49),
% 0.21/0.49 inference(or_elim,[status(thm)],[21])).
% 0.21/0.49 tff(27,plain,
% 0.21/0.49 (rearsegP(V!48, U!47) <=> rearsegP(X!50, W!49)),
% 0.21/0.49 inference(monotonicity,[status(thm)],[22, 26])).
% 0.21/0.49 tff(28,plain,
% 0.21/0.49 ((~rearsegP(V!48, U!47)) <=> (~rearsegP(X!50, W!49))),
% 0.21/0.49 inference(monotonicity,[status(thm)],[27])).
% 0.21/0.49 tff(29,plain,
% 0.21/0.49 (~rearsegP(V!48, U!47)),
% 0.21/0.49 inference(or_elim,[status(thm)],[21])).
% 0.21/0.49 tff(30,plain,
% 0.21/0.49 (~rearsegP(X!50, W!49)),
% 0.21/0.49 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.21/0.49 tff(31,plain,
% 0.21/0.49 (((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))) | rearsegP(X!50, W!49)),
% 0.21/0.49 inference(tautology,[status(thm)],[])).
% 0.21/0.49 tff(32,plain,
% 0.21/0.49 ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))),
% 0.21/0.49 inference(unit_resolution,[status(thm)],[31, 30])).
% 0.21/0.49 tff(33,plain,
% 0.21/0.49 ((~(~((~neq(X!50, nil)) | (~((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))))))) <=> ((~neq(X!50, nil)) | (~((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))))),
% 0.21/0.49 inference(rewrite,[status(thm)],[])).
% 0.21/0.49 tff(34,plain,
% 0.21/0.49 ((neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))) <=> (~((~neq(X!50, nil)) | (~((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))))))),
% 0.21/0.49 inference(rewrite,[status(thm)],[])).
% 0.21/0.49 tff(35,plain,
% 0.21/0.49 ((~(neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))))) <=> (~(~((~neq(X!50, nil)) | (~((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))))))),
% 0.21/0.49 inference(monotonicity,[status(thm)],[34])).
% 0.21/0.49 tff(36,plain,
% 0.21/0.49 ((~(neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))))) <=> ((~neq(X!50, nil)) | (~((~neq(W!49, nil)) | (~rearsegP(X!50, W!49)))))),
% 0.21/0.49 inference(transitivity,[status(thm)],[35, 33])).
% 0.21/0.49 tff(37,plain,
% 0.21/0.49 (~(neq(X!50, nil) & ((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))))),
% 0.21/0.49 inference(or_elim,[status(thm)],[21])).
% 0.21/0.49 tff(38,plain,
% 0.21/0.49 ((~neq(X!50, nil)) | (~((~neq(W!49, nil)) | (~rearsegP(X!50, W!49))))),
% 0.21/0.49 inference(modus_ponens,[status(thm)],[37, 36])).
% 0.21/0.49 tff(39,plain,
% 0.21/0.49 ($false),
% 0.21/0.49 inference(unit_resolution,[status(thm)],[38, 32, 25])).
% 0.21/0.49 % SZS output end Proof
%------------------------------------------------------------------------------