TSTP Solution File: SWC038+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC038+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n024.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:54:49 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC038+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n024.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 : Sat Sep 3 20:56:03 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.20/0.46 % SZS status Theorem
% 0.20/0.46 % SZS output start Proof
% 0.20/0.46 tff(frontsegP_type, type, (
% 0.20/0.46 frontsegP: ( $i * $i ) > $o)).
% 0.20/0.46 tff(tptp_fun_W_49_type, type, (
% 0.20/0.46 tptp_fun_W_49: $i)).
% 0.20/0.46 tff(nil_type, type, (
% 0.20/0.46 nil: $i)).
% 0.20/0.46 tff(tptp_fun_X_50_type, type, (
% 0.20/0.46 tptp_fun_X_50: $i)).
% 0.20/0.46 tff(tptp_fun_V_48_type, type, (
% 0.20/0.46 tptp_fun_V_48: $i)).
% 0.20/0.46 tff(neq_type, type, (
% 0.20/0.46 neq: ( $i * $i ) > $o)).
% 0.20/0.46 tff(ssList_type, type, (
% 0.20/0.46 ssList: $i > $o)).
% 0.20/0.46 tff(tptp_fun_U_47_type, type, (
% 0.20/0.46 tptp_fun_U_47: $i)).
% 0.20/0.46 tff(1,plain,
% 0.20/0.46 ((ssList(U!47) & (ssList(V!48) & ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))) <=> (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))),
% 0.20/0.46 inference(rewrite,[status(thm)],[])).
% 0.20/0.46 tff(2,plain,
% 0.20/0.46 ((ssList(V!48) & (ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))) <=> (ssList(V!48) & ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))),
% 0.20/0.46 inference(rewrite,[status(thm)],[])).
% 0.20/0.46 tff(3,plain,
% 0.20/0.46 (((~(~ssList(W!49))) & (~((nil = U!47) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~(nil = V!48)) | (~ssList(X!50)) | (((~(nil = X!50)) | (~(nil = W!49))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))) <=> (ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))),
% 0.20/0.46 inference(rewrite,[status(thm)],[])).
% 0.20/0.46 tff(4,plain,
% 0.20/0.46 ((~(~ssList(V!48))) <=> ssList(V!48)),
% 0.20/0.46 inference(rewrite,[status(thm)],[])).
% 0.20/0.46 tff(5,plain,
% 0.20/0.46 (((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~((nil = U!47) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~(nil = V!48)) | (~ssList(X!50)) | (((~(nil = X!50)) | (~(nil = W!49))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))) <=> (ssList(V!48) & (ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))))),
% 0.20/0.46 inference(monotonicity,[status(thm)],[4, 3])).
% 0.20/0.46 tff(6,plain,
% 0.20/0.46 (((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~((nil = U!47) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~(nil = V!48)) | (~ssList(X!50)) | (((~(nil = X!50)) | (~(nil = W!49))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))) <=> (ssList(V!48) & ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))),
% 0.20/0.46 inference(transitivity,[status(thm)],[5, 2])).
% 0.20/0.46 tff(7,plain,
% 0.20/0.46 ((~(~ssList(U!47))) <=> ssList(U!47)),
% 0.20/0.46 inference(rewrite,[status(thm)],[])).
% 0.20/0.46 tff(8,plain,
% 0.20/0.46 (((~(~ssList(U!47))) & ((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~((nil = U!47) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~(nil = V!48)) | (~ssList(X!50)) | (((~(nil = X!50)) | (~(nil = W!49))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))))) <=> (ssList(U!47) & (ssList(V!48) & ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))))),
% 0.20/0.46 inference(monotonicity,[status(thm)],[7, 6])).
% 0.20/0.46 tff(9,plain,
% 0.20/0.46 (((~(~ssList(U!47))) & ((~(~ssList(V!48))) & ((~(~ssList(W!49))) & (~((nil = U!47) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~(nil = V!48)) | (~ssList(X!50)) | (((~(nil = X!50)) | (~(nil = W!49))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))))) <=> (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))),
% 0.20/0.47 inference(transitivity,[status(thm)],[8, 1])).
% 0.20/0.47 tff(10,plain,
% 0.20/0.47 ((~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil)))))))))),
% 0.20/0.47 inference(rewrite,[status(thm)],[])).
% 0.20/0.47 tff(11,plain,
% 0.20/0.47 ((~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (((((~(nil = V)) | (~(V = X))) | (~(U = W))) | (nil = U)) | (((~(nil = X)) | (~(nil = W))) & ((~neq(W, nil)) | (~frontsegP(X, W)))))))))) <=> (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil)))))))))),
% 0.20/0.47 inference(rewrite,[status(thm)],[])).
% 0.20/0.47 tff(12,axiom,(~![U: $i] : (ssList(U) => ![V: $i] : (ssList(V) => ![W: $i] : (ssList(W) => ![X: $i] : (ssList(X) => (((((~(nil = V)) | (~(V = X))) | (~(U = W))) | (nil = U)) | (((~(nil = X)) | (~(nil = W))) & ((~neq(W, nil)) | (~frontsegP(X, W)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','co1')).
% 0.20/0.47 tff(13,plain,
% 0.20/0.47 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[12, 11])).
% 0.20/0.47 tff(14,plain,
% 0.20/0.47 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[13, 10])).
% 0.20/0.47 tff(15,plain,
% 0.20/0.47 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[14, 10])).
% 0.20/0.47 tff(16,plain,
% 0.20/0.47 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[15, 10])).
% 0.20/0.47 tff(17,plain,
% 0.20/0.47 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[16, 10])).
% 0.20/0.47 tff(18,plain,
% 0.20/0.47 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[17, 10])).
% 0.20/0.47 tff(19,plain,
% 0.20/0.47 (~![U: $i] : ((~ssList(U)) | ![V: $i] : ((~ssList(V)) | ![W: $i] : ((~ssList(W)) | ![X: $i] : ((nil = U) | (~(U = W)) | (~(V = X)) | (~(nil = V)) | (~ssList(X)) | (((~(nil = X)) | (~(nil = W))) & ((~frontsegP(X, W)) | (~neq(W, nil))))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[18, 10])).
% 0.20/0.47 tff(20,plain,
% 0.20/0.47 (ssList(U!47) & ssList(V!48) & ssList(W!49) & (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[19, 9])).
% 0.20/0.47 tff(21,plain,
% 0.20/0.47 (~((nil = U!47) | (~(nil = V!48)) | (~(U!47 = W!49)) | (~(V!48 = X!50)) | (~ssList(X!50)) | (((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))),
% 0.20/0.47 inference(and_elim,[status(thm)],[20])).
% 0.20/0.47 tff(22,plain,
% 0.20/0.47 (V!48 = X!50),
% 0.20/0.47 inference(or_elim,[status(thm)],[21])).
% 0.20/0.47 tff(23,plain,
% 0.20/0.47 (nil = V!48),
% 0.20/0.47 inference(or_elim,[status(thm)],[21])).
% 0.20/0.47 tff(24,plain,
% 0.20/0.47 (nil = X!50),
% 0.20/0.47 inference(transitivity,[status(thm)],[23, 22])).
% 0.20/0.47 tff(25,plain,
% 0.20/0.47 (frontsegP(nil, W!49) <=> frontsegP(X!50, W!49)),
% 0.20/0.47 inference(monotonicity,[status(thm)],[24])).
% 0.20/0.47 tff(26,plain,
% 0.20/0.47 (frontsegP(X!50, W!49) <=> frontsegP(nil, W!49)),
% 0.20/0.47 inference(symmetry,[status(thm)],[25])).
% 0.20/0.47 tff(27,plain,
% 0.20/0.47 (U!47 = W!49),
% 0.20/0.47 inference(or_elim,[status(thm)],[21])).
% 0.20/0.47 tff(28,plain,
% 0.20/0.47 ((nil = U!47) <=> (nil = W!49)),
% 0.20/0.47 inference(monotonicity,[status(thm)],[27])).
% 0.20/0.47 tff(29,plain,
% 0.20/0.47 ((~(nil = U!47)) <=> (~(nil = W!49))),
% 0.20/0.47 inference(monotonicity,[status(thm)],[28])).
% 0.20/0.47 tff(30,plain,
% 0.20/0.47 (~(nil = U!47)),
% 0.20/0.47 inference(or_elim,[status(thm)],[21])).
% 0.20/0.47 tff(31,plain,
% 0.20/0.47 (~(nil = W!49)),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[30, 29])).
% 0.20/0.47 tff(32,plain,
% 0.20/0.47 (((~(nil = W!49)) | (~(nil = X!50))) | (nil = W!49)),
% 0.20/0.47 inference(tautology,[status(thm)],[])).
% 0.20/0.47 tff(33,plain,
% 0.20/0.47 ((~(nil = W!49)) | (~(nil = X!50))),
% 0.20/0.47 inference(unit_resolution,[status(thm)],[32, 31])).
% 0.20/0.47 tff(34,plain,
% 0.20/0.47 ((~(~((~((~(nil = W!49)) | (~(nil = X!50)))) | (~((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))) <=> ((~((~(nil = W!49)) | (~(nil = X!50)))) | (~((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))),
% 0.20/0.47 inference(rewrite,[status(thm)],[])).
% 0.20/0.47 tff(35,plain,
% 0.20/0.47 ((((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))) <=> (~((~((~(nil = W!49)) | (~(nil = X!50)))) | (~((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))))),
% 0.20/0.47 inference(rewrite,[status(thm)],[])).
% 0.20/0.47 tff(36,plain,
% 0.20/0.47 ((~(((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))) <=> (~(~((~((~(nil = W!49)) | (~(nil = X!50)))) | (~((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))))),
% 0.20/0.47 inference(monotonicity,[status(thm)],[35])).
% 0.20/0.47 tff(37,plain,
% 0.20/0.47 ((~(((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))) <=> ((~((~(nil = W!49)) | (~(nil = X!50)))) | (~((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))))),
% 0.20/0.47 inference(transitivity,[status(thm)],[36, 34])).
% 0.20/0.47 tff(38,plain,
% 0.20/0.47 (~(((~(nil = W!49)) | (~(nil = X!50))) & ((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))),
% 0.20/0.47 inference(or_elim,[status(thm)],[21])).
% 0.20/0.47 tff(39,plain,
% 0.20/0.47 ((~((~(nil = W!49)) | (~(nil = X!50)))) | (~((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[38, 37])).
% 0.20/0.47 tff(40,plain,
% 0.20/0.47 (~((~frontsegP(X!50, W!49)) | (~neq(W!49, nil)))),
% 0.20/0.47 inference(unit_resolution,[status(thm)],[39, 33])).
% 0.20/0.47 tff(41,plain,
% 0.20/0.47 (((~frontsegP(X!50, W!49)) | (~neq(W!49, nil))) | frontsegP(X!50, W!49)),
% 0.20/0.47 inference(tautology,[status(thm)],[])).
% 0.20/0.47 tff(42,plain,
% 0.20/0.47 (frontsegP(X!50, W!49)),
% 0.20/0.47 inference(unit_resolution,[status(thm)],[41, 40])).
% 0.20/0.47 tff(43,plain,
% 0.20/0.47 (frontsegP(nil, W!49)),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[42, 26])).
% 0.20/0.47 tff(44,plain,
% 0.20/0.47 (ssList(W!49)),
% 0.20/0.47 inference(and_elim,[status(thm)],[20])).
% 0.20/0.47 tff(45,plain,
% 0.20/0.47 (^[U: $i] : refl(((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U))) <=> ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U))))),
% 0.20/0.47 inference(bind,[status(th)],[])).
% 0.20/0.47 tff(46,plain,
% 0.20/0.47 (![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U))) <=> ![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))),
% 0.20/0.47 inference(quant_intro,[status(thm)],[45])).
% 0.20/0.47 tff(47,plain,
% 0.20/0.47 (![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U))) <=> ![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))),
% 0.20/0.47 inference(rewrite,[status(thm)],[])).
% 0.20/0.47 tff(48,plain,
% 0.20/0.47 (^[U: $i] : rewrite((ssList(U) => (frontsegP(nil, U) <=> (nil = U))) <=> ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U))))),
% 0.20/0.47 inference(bind,[status(th)],[])).
% 0.20/0.47 tff(49,plain,
% 0.20/0.47 (![U: $i] : (ssList(U) => (frontsegP(nil, U) <=> (nil = U))) <=> ![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))),
% 0.20/0.47 inference(quant_intro,[status(thm)],[48])).
% 0.20/0.47 tff(50,axiom,(![U: $i] : (ssList(U) => (frontsegP(nil, U) <=> (nil = U)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax','ax46')).
% 0.20/0.47 tff(51,plain,
% 0.20/0.47 (![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[50, 49])).
% 0.20/0.47 tff(52,plain,
% 0.20/0.47 (![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[51, 47])).
% 0.20/0.47 tff(53,plain,(
% 0.20/0.47 ![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))),
% 0.20/0.47 inference(skolemize,[status(sab)],[52])).
% 0.20/0.47 tff(54,plain,
% 0.20/0.47 (![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[53, 46])).
% 0.20/0.47 tff(55,plain,
% 0.20/0.47 (((~![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))) | ((~ssList(W!49)) | (frontsegP(nil, W!49) <=> (nil = W!49)))) <=> ((~![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))) | (~ssList(W!49)) | (frontsegP(nil, W!49) <=> (nil = W!49)))),
% 0.20/0.47 inference(rewrite,[status(thm)],[])).
% 0.20/0.47 tff(56,plain,
% 0.20/0.47 ((~![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))) | ((~ssList(W!49)) | (frontsegP(nil, W!49) <=> (nil = W!49)))),
% 0.20/0.47 inference(quant_inst,[status(thm)],[])).
% 0.20/0.47 tff(57,plain,
% 0.20/0.47 ((~![U: $i] : ((~ssList(U)) | (frontsegP(nil, U) <=> (nil = U)))) | (~ssList(W!49)) | (frontsegP(nil, W!49) <=> (nil = W!49))),
% 0.20/0.47 inference(modus_ponens,[status(thm)],[56, 55])).
% 0.20/0.47 tff(58,plain,
% 0.20/0.47 (frontsegP(nil, W!49) <=> (nil = W!49)),
% 0.20/0.47 inference(unit_resolution,[status(thm)],[57, 54, 44])).
% 0.20/0.47 tff(59,plain,
% 0.20/0.47 ((~(frontsegP(nil, W!49) <=> (nil = W!49))) | (~frontsegP(nil, W!49)) | (nil = W!49)),
% 0.20/0.47 inference(tautology,[status(thm)],[])).
% 0.20/0.47 tff(60,plain,
% 0.20/0.47 ((~(frontsegP(nil, W!49) <=> (nil = W!49))) | (~frontsegP(nil, W!49))),
% 0.20/0.47 inference(unit_resolution,[status(thm)],[59, 31])).
% 0.20/0.47 tff(61,plain,
% 0.20/0.47 (~frontsegP(nil, W!49)),
% 0.20/0.47 inference(unit_resolution,[status(thm)],[60, 58])).
% 0.20/0.47 tff(62,plain,
% 0.20/0.47 ($false),
% 0.20/0.47 inference(unit_resolution,[status(thm)],[61, 43])).
% 0.20/0.47 % SZS output end Proof
%------------------------------------------------------------------------------