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