TSTP Solution File: LAT381+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n008.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 : 600s
% DateTime : Sun Jul 17 05:40:30 EDT 2022
% Result : Theorem 0.14s 0.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 28 19:01:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 % SZS status Theorem
% 0.14/0.38 % SZS output begin IncompleteProof
% 0.14/0.38 cnf(c0, axiom,
% 0.14/0.38 xu != xv).
% 0.14/0.38 cnf(c1, plain,
% 0.14/0.38 xu != xv,
% 0.14/0.38 inference(start, [], [c0])).
% 0.14/0.38
% 0.14/0.38 cnf(c2, axiom,
% 0.14/0.38 X0 = X1 | ~sdtlseqdt0(X1,X0) | ~sdtlseqdt0(X0,X1) | ~aElement0(X1) | ~aElement0(X0)).
% 0.14/0.38 cnf(a0, assumption,
% 0.14/0.38 xu = X1).
% 0.14/0.38 cnf(c3, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.38 cnf(c4, plain,
% 0.14/0.38 ~sdtlseqdt0(X1,X0) | ~sdtlseqdt0(X0,X1) | ~aElement0(X1) | ~aElement0(X0),
% 0.14/0.38 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.38 cnf(c5, plain,
% 0.14/0.38 X0 != X2 | X2 != xv,
% 0.14/0.38 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.38
% 0.14/0.38 cnf(a1, assumption,
% 0.14/0.38 X0 = X2).
% 0.14/0.38 cnf(c6, plain,
% 0.14/0.38 X2 != xv,
% 0.14/0.38 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.14/0.38
% 0.14/0.38 cnf(a2, assumption,
% 0.14/0.38 X2 = xv).
% 0.14/0.38 cnf(c7, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.14/0.38
% 0.14/0.38 cnf(c8, axiom,
% 0.14/0.38 sdtlseqdt0(xu,X3) | ~aUpperBoundOfIn0(X3,xS,xT)).
% 0.14/0.38 cnf(a3, assumption,
% 0.14/0.38 X1 = xu).
% 0.14/0.38 cnf(a4, assumption,
% 0.14/0.38 X0 = X3).
% 0.14/0.38 cnf(c9, plain,
% 0.14/0.38 ~sdtlseqdt0(X0,X1) | ~aElement0(X1) | ~aElement0(X0),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.14/0.38 cnf(c10, plain,
% 0.14/0.38 ~aUpperBoundOfIn0(X3,xS,xT),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.14/0.38
% 0.14/0.38 cnf(c11, axiom,
% 0.14/0.38 aUpperBoundOfIn0(xv,xS,xT)).
% 0.14/0.38 cnf(a5, assumption,
% 0.14/0.38 X3 = xv).
% 0.14/0.38 cnf(a6, assumption,
% 0.14/0.38 xS = xS).
% 0.14/0.38 cnf(a7, assumption,
% 0.14/0.38 xT = xT).
% 0.14/0.38 cnf(c12, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c10, c11])).
% 0.14/0.38 cnf(c13, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c10, c11])).
% 0.14/0.38
% 0.14/0.38 cnf(c14, axiom,
% 0.14/0.38 sdtlseqdt0(xv,X4) | ~aUpperBoundOfIn0(X4,xS,xT)).
% 0.14/0.38 cnf(a8, assumption,
% 0.14/0.38 X0 = xv).
% 0.14/0.38 cnf(a9, assumption,
% 0.14/0.38 X1 = X4).
% 0.14/0.38 cnf(c15, plain,
% 0.14/0.38 ~aElement0(X1) | ~aElement0(X0),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.14/0.38 cnf(c16, plain,
% 0.14/0.38 ~aUpperBoundOfIn0(X4,xS,xT),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.14/0.38
% 0.14/0.38 cnf(c17, axiom,
% 0.14/0.38 aUpperBoundOfIn0(xu,xS,xT)).
% 0.14/0.38 cnf(a10, assumption,
% 0.14/0.38 X4 = xu).
% 0.14/0.38 cnf(a11, assumption,
% 0.14/0.38 xS = xS).
% 0.14/0.38 cnf(a12, assumption,
% 0.14/0.38 xT = xT).
% 0.14/0.38 cnf(c18, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c16, c17])).
% 0.14/0.38 cnf(c19, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c16, c17])).
% 0.14/0.38
% 0.14/0.38 cnf(c20, axiom,
% 0.14/0.38 aElement0(X5) | ~aElementOf0(X5,X6) | ~aSet0(X6)).
% 0.14/0.38 cnf(a13, assumption,
% 0.14/0.38 X1 = X5).
% 0.14/0.38 cnf(c21, plain,
% 0.14/0.38 ~aElement0(X0),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a13])], [c15, c20])).
% 0.14/0.38 cnf(c22, plain,
% 0.14/0.38 ~aElementOf0(X5,X6) | ~aSet0(X6),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a13])], [c15, c20])).
% 0.14/0.38
% 0.14/0.38 cnf(c23, axiom,
% 0.14/0.38 aElementOf0(xu,xT)).
% 0.14/0.38 cnf(a14, assumption,
% 0.14/0.38 X5 = xu).
% 0.14/0.38 cnf(a15, assumption,
% 0.14/0.38 X6 = xT).
% 0.14/0.38 cnf(c24, plain,
% 0.14/0.38 ~aSet0(X6),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 0.14/0.38 cnf(c25, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])).
% 0.14/0.38
% 0.14/0.38 cnf(c26, axiom,
% 0.14/0.38 aSet0(xT)).
% 0.14/0.38 cnf(a16, assumption,
% 0.14/0.38 X6 = xT).
% 0.14/0.38 cnf(c27, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a16])], [c24, c26])).
% 0.14/0.38 cnf(c28, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a16])], [c24, c26])).
% 0.14/0.38
% 0.14/0.38 cnf(c29, axiom,
% 0.14/0.38 aElement0(X7) | ~aElementOf0(X7,X8) | ~aSet0(X8)).
% 0.14/0.38 cnf(a17, assumption,
% 0.14/0.38 X0 = X7).
% 0.14/0.38 cnf(c30, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a17])], [c21, c29])).
% 0.14/0.38 cnf(c31, plain,
% 0.14/0.38 ~aElementOf0(X7,X8) | ~aSet0(X8),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a17])], [c21, c29])).
% 0.14/0.38
% 0.14/0.38 cnf(c32, axiom,
% 0.14/0.38 aElementOf0(xv,xT)).
% 0.14/0.38 cnf(a18, assumption,
% 0.14/0.38 X7 = xv).
% 0.14/0.38 cnf(a19, assumption,
% 0.14/0.38 X8 = xT).
% 0.14/0.38 cnf(c33, plain,
% 0.14/0.38 ~aSet0(X8),
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a18, a19])], [c31, c32])).
% 0.14/0.38 cnf(c34, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(strict_predicate_extension, [assumptions([a18, a19])], [c31, c32])).
% 0.14/0.38
% 0.14/0.38 cnf(c35, plain,
% 0.14/0.38 aSet0(X6)).
% 0.14/0.38 cnf(a20, assumption,
% 0.14/0.38 X8 = X6).
% 0.14/0.38 cnf(c36, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(predicate_reduction, [assumptions([a20])], [c33, c35])).
% 0.14/0.38
% 0.14/0.38 cnf(c37, plain,
% 0.14/0.38 $false,
% 0.14/0.38 inference(constraint_solving, [
% 0.14/0.38 bind(X0, xv),
% 0.14/0.38 bind(X1, xu),
% 0.14/0.38 bind(X2, xv),
% 0.14/0.38 bind(X3, xv),
% 0.14/0.38 bind(X4, xu),
% 0.14/0.38 bind(X5, xu),
% 0.14/0.38 bind(X6, xT),
% 0.14/0.38 bind(X7, xv),
% 0.14/0.38 bind(X8, xT)
% 0.14/0.38 ],
% 0.14/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])).
% 0.14/0.38
% 0.14/0.38 % SZS output end IncompleteProof
%------------------------------------------------------------------------------