TSTP Solution File: NUM582+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM582+1 : 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 : n029.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 : Mon Jul 18 11:34:13 EDT 2022
% Result : Theorem 2.37s 0.70s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM582+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 23:40:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.37/0.70 % SZS status Theorem
% 2.37/0.70 % SZS output begin IncompleteProof
% 2.37/0.70 cnf(c0, axiom,
% 2.37/0.70 ~aSubsetOf0(sdtlpdtrp0(xN,xi),xS)).
% 2.37/0.70 cnf(c1, plain,
% 2.37/0.70 ~aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
% 2.37/0.70 inference(start, [], [c0])).
% 2.37/0.70
% 2.37/0.70 cnf(c2, axiom,
% 2.37/0.70 aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) | ~sdtlseqdt0(X1,X0) | ~aElementOf0(X1,szNzAzT0) | ~aElementOf0(X0,szNzAzT0)).
% 2.37/0.70 cnf(a0, assumption,
% 2.37/0.70 X2 = sdtlpdtrp0(xN,xi)).
% 2.37/0.70 cnf(a1, assumption,
% 2.37/0.70 X3 = xS).
% 2.37/0.70 cnf(c3, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.37/0.70 cnf(c4, plain,
% 2.37/0.70 ~sdtlseqdt0(X1,X0) | ~aElementOf0(X1,szNzAzT0) | ~aElementOf0(X0,szNzAzT0),
% 2.37/0.70 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.37/0.70 cnf(c5, plain,
% 2.37/0.70 sdtlpdtrp0(xN,X0) != X2 | sdtlpdtrp0(xN,X1) != X3,
% 2.37/0.70 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.37/0.70
% 2.37/0.70 cnf(a2, assumption,
% 2.37/0.70 sdtlpdtrp0(xN,X0) = X2).
% 2.37/0.70 cnf(c6, plain,
% 2.37/0.70 sdtlpdtrp0(xN,X1) != X3,
% 2.37/0.70 inference(reflexivity, [assumptions([a2])], [c5])).
% 2.37/0.70
% 2.37/0.70 cnf(c7, axiom,
% 2.37/0.70 xS = sdtlpdtrp0(xN,sz00)).
% 2.37/0.70 cnf(a3, assumption,
% 2.37/0.70 sdtlpdtrp0(xN,X1) = sdtlpdtrp0(xN,sz00)).
% 2.37/0.70 cnf(c8, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(strict_function_extension, [assumptions([a3])], [c6, c7])).
% 2.37/0.70 cnf(c9, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(strict_function_extension, [assumptions([a3])], [c6, c7])).
% 2.37/0.70 cnf(c10, plain,
% 2.37/0.70 X4 != xS | X4 != X3,
% 2.37/0.70 inference(strict_function_extension, [assumptions([a3])], [c6, c7])).
% 2.37/0.70
% 2.37/0.70 cnf(a4, assumption,
% 2.37/0.70 X4 = xS).
% 2.37/0.70 cnf(c11, plain,
% 2.37/0.70 X4 != X3,
% 2.37/0.70 inference(reflexivity, [assumptions([a4])], [c10])).
% 2.37/0.70
% 2.37/0.70 cnf(a5, assumption,
% 2.37/0.70 X4 = X3).
% 2.37/0.70 cnf(c12, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(reflexivity, [assumptions([a5])], [c11])).
% 2.37/0.70
% 2.37/0.70 cnf(c13, axiom,
% 2.37/0.70 sdtlseqdt0(sz00,X5) | ~aElementOf0(X5,szNzAzT0)).
% 2.37/0.70 cnf(a6, assumption,
% 2.37/0.70 X1 = sz00).
% 2.37/0.70 cnf(a7, assumption,
% 2.37/0.70 X0 = X5).
% 2.37/0.70 cnf(c14, plain,
% 2.37/0.70 ~aElementOf0(X1,szNzAzT0) | ~aElementOf0(X0,szNzAzT0),
% 2.37/0.70 inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c13])).
% 2.37/0.70 cnf(c15, plain,
% 2.37/0.70 ~aElementOf0(X5,szNzAzT0),
% 2.37/0.70 inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c13])).
% 2.37/0.70
% 2.37/0.70 cnf(c16, axiom,
% 2.37/0.70 aElementOf0(xi,szNzAzT0)).
% 2.37/0.70 cnf(a8, assumption,
% 2.37/0.70 X5 = xi).
% 2.37/0.70 cnf(a9, assumption,
% 2.37/0.70 szNzAzT0 = szNzAzT0).
% 2.37/0.70 cnf(c17, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(strict_predicate_extension, [assumptions([a8, a9])], [c15, c16])).
% 2.37/0.70 cnf(c18, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(strict_predicate_extension, [assumptions([a8, a9])], [c15, c16])).
% 2.37/0.70
% 2.37/0.70 cnf(c19, axiom,
% 2.37/0.70 aElementOf0(sz00,szNzAzT0)).
% 2.37/0.70 cnf(a10, assumption,
% 2.37/0.70 X1 = sz00).
% 2.37/0.70 cnf(a11, assumption,
% 2.37/0.70 szNzAzT0 = szNzAzT0).
% 2.37/0.70 cnf(c20, plain,
% 2.37/0.70 ~aElementOf0(X0,szNzAzT0),
% 2.37/0.70 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c19])).
% 2.37/0.70 cnf(c21, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c19])).
% 2.37/0.70
% 2.37/0.70 cnf(c22, plain,
% 2.37/0.70 aElementOf0(X5,szNzAzT0)).
% 2.37/0.70 cnf(a12, assumption,
% 2.37/0.70 X0 = X5).
% 2.37/0.70 cnf(a13, assumption,
% 2.37/0.70 szNzAzT0 = szNzAzT0).
% 2.37/0.70 cnf(c23, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(predicate_reduction, [assumptions([a12, a13])], [c20, c22])).
% 2.37/0.70
% 2.37/0.70 cnf(c24, plain,
% 2.37/0.70 $false,
% 2.37/0.70 inference(constraint_solving, [
% 2.37/0.70 bind(X0, xi),
% 2.37/0.70 bind(X1, sz00),
% 2.37/0.70 bind(X2, sdtlpdtrp0(xN,xi)),
% 2.37/0.70 bind(X3, xS),
% 2.37/0.70 bind(X4, xS),
% 2.37/0.70 bind(X5, xi)
% 2.37/0.70 ],
% 2.37/0.70 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 2.37/0.70
% 2.37/0.70 % SZS output end IncompleteProof
%------------------------------------------------------------------------------