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