TSTP Solution File: RNG114+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : RNG114+4 : 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 : 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 : 600s
% DateTime : Mon Jul 18 20:33:34 EDT 2022
% Result : Theorem 55.98s 7.90s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG114+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n024.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 : Mon May 30 15:00:51 EDT 2022
% 0.12/0.35 % CPUTime :
% 55.98/7.90 % SZS status Theorem
% 55.98/7.90 % SZS output begin IncompleteProof
% 55.98/7.90 cnf(c0, axiom,
% 55.98/7.90 xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) | ~aElement0(X1) | ~aElement0(X0)).
% 55.98/7.90 cnf(c1, plain,
% 55.98/7.90 xu != sdtpldt0(sdtasdt0(xa,X0),sdtasdt0(xb,X1)) | ~aElement0(X1) | ~aElement0(X0),
% 55.98/7.90 inference(start, [], [c0])).
% 55.98/7.90
% 55.98/7.90 cnf(c2, axiom,
% 55.98/7.90 sdtasdt0(xa,sK63(X2)) = X2 | ~aElementOf0(X2,slsdtgt0(xa))).
% 55.98/7.90 cnf(a0, assumption,
% 55.98/7.90 sdtasdt0(xa,X0) = sdtasdt0(xa,sK63(X2))).
% 55.98/7.90 cnf(c3, plain,
% 55.98/7.90 ~aElement0(X1) | ~aElement0(X0),
% 55.98/7.90 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 55.98/7.90 cnf(c4, plain,
% 55.98/7.90 ~aElementOf0(X2,slsdtgt0(xa)),
% 55.98/7.90 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 55.98/7.90 cnf(c5, plain,
% 55.98/7.90 X3 != X2 | xu != sdtpldt0(X3,sdtasdt0(xb,X1)),
% 55.98/7.90 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 55.98/7.90
% 55.98/7.90 cnf(a1, assumption,
% 55.98/7.90 X3 = X2).
% 55.98/7.90 cnf(c6, plain,
% 55.98/7.90 xu != sdtpldt0(X3,sdtasdt0(xb,X1)),
% 55.98/7.90 inference(reflexivity, [assumptions([a1])], [c5])).
% 55.98/7.90
% 55.98/7.90 cnf(c7, axiom,
% 55.98/7.90 sdtasdt0(xb,sK62(X4)) = X4 | ~aElementOf0(X4,slsdtgt0(xb))).
% 55.98/7.90 cnf(a2, assumption,
% 55.98/7.90 sdtasdt0(xb,X1) = sdtasdt0(xb,sK62(X4))).
% 55.98/7.90 cnf(c8, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 55.98/7.90 cnf(c9, plain,
% 55.98/7.90 ~aElementOf0(X4,slsdtgt0(xb)),
% 55.98/7.90 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 55.98/7.90 cnf(c10, plain,
% 55.98/7.90 X5 != X4 | xu != sdtpldt0(X3,X5),
% 55.98/7.90 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 55.98/7.90
% 55.98/7.90 cnf(a3, assumption,
% 55.98/7.90 X5 = X4).
% 55.98/7.90 cnf(c11, plain,
% 55.98/7.90 xu != sdtpldt0(X3,X5),
% 55.98/7.90 inference(reflexivity, [assumptions([a3])], [c10])).
% 55.98/7.90
% 55.98/7.90 cnf(c12, axiom,
% 55.98/7.90 xu = sdtpldt0(sK64,sK65)).
% 55.98/7.90 cnf(a4, assumption,
% 55.98/7.90 sdtpldt0(X3,X5) = sdtpldt0(sK64,sK65)).
% 55.98/7.90 cnf(c13, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 55.98/7.90 cnf(c14, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 55.98/7.90 cnf(c15, plain,
% 55.98/7.90 X6 != xu | xu != X6,
% 55.98/7.90 inference(strict_function_extension, [assumptions([a4])], [c11, c12])).
% 55.98/7.90
% 55.98/7.90 cnf(a5, assumption,
% 55.98/7.90 X6 = xu).
% 55.98/7.90 cnf(c16, plain,
% 55.98/7.90 xu != X6,
% 55.98/7.90 inference(reflexivity, [assumptions([a5])], [c15])).
% 55.98/7.90
% 55.98/7.90 cnf(a6, assumption,
% 55.98/7.90 xu = X6).
% 55.98/7.90 cnf(c17, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(reflexivity, [assumptions([a6])], [c16])).
% 55.98/7.90
% 55.98/7.90 cnf(c18, axiom,
% 55.98/7.90 aElementOf0(sK65,slsdtgt0(xb))).
% 55.98/7.90 cnf(a7, assumption,
% 55.98/7.90 X4 = sK65).
% 55.98/7.90 cnf(a8, assumption,
% 55.98/7.90 slsdtgt0(xb) = slsdtgt0(xb)).
% 55.98/7.90 cnf(c19, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c18])).
% 55.98/7.90 cnf(c20, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a7, a8])], [c9, c18])).
% 55.98/7.90
% 55.98/7.90 cnf(c21, axiom,
% 55.98/7.90 aElementOf0(sK64,slsdtgt0(xa))).
% 55.98/7.90 cnf(a9, assumption,
% 55.98/7.90 X2 = sK64).
% 55.98/7.90 cnf(a10, assumption,
% 55.98/7.90 slsdtgt0(xa) = slsdtgt0(xa)).
% 55.98/7.90 cnf(c22, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a9, a10])], [c4, c21])).
% 55.98/7.90 cnf(c23, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a9, a10])], [c4, c21])).
% 55.98/7.90
% 55.98/7.90 cnf(c24, axiom,
% 55.98/7.90 aElement0(sK62(X7)) | ~aElementOf0(X7,slsdtgt0(xb))).
% 55.98/7.90 cnf(a11, assumption,
% 55.98/7.90 X1 = sK62(X7)).
% 55.98/7.90 cnf(c25, plain,
% 55.98/7.90 ~aElement0(X0),
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a11])], [c3, c24])).
% 55.98/7.90 cnf(c26, plain,
% 55.98/7.90 ~aElementOf0(X7,slsdtgt0(xb)),
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a11])], [c3, c24])).
% 55.98/7.90
% 55.98/7.90 cnf(c27, plain,
% 55.98/7.90 aElementOf0(X4,slsdtgt0(xb))).
% 55.98/7.90 cnf(a12, assumption,
% 55.98/7.90 X7 = X4).
% 55.98/7.90 cnf(a13, assumption,
% 55.98/7.90 slsdtgt0(xb) = slsdtgt0(xb)).
% 55.98/7.90 cnf(c28, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(predicate_reduction, [assumptions([a12, a13])], [c26, c27])).
% 55.98/7.90
% 55.98/7.90 cnf(c29, axiom,
% 55.98/7.90 aElement0(sK63(X8)) | ~aElementOf0(X8,slsdtgt0(xa))).
% 55.98/7.90 cnf(a14, assumption,
% 55.98/7.90 X0 = sK63(X8)).
% 55.98/7.90 cnf(c30, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a14])], [c25, c29])).
% 55.98/7.90 cnf(c31, plain,
% 55.98/7.90 ~aElementOf0(X8,slsdtgt0(xa)),
% 55.98/7.90 inference(strict_predicate_extension, [assumptions([a14])], [c25, c29])).
% 55.98/7.90
% 55.98/7.90 cnf(c32, plain,
% 55.98/7.90 aElementOf0(X2,slsdtgt0(xa))).
% 55.98/7.90 cnf(a15, assumption,
% 55.98/7.90 X8 = X2).
% 55.98/7.90 cnf(a16, assumption,
% 55.98/7.90 slsdtgt0(xa) = slsdtgt0(xa)).
% 55.98/7.90 cnf(c33, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(predicate_reduction, [assumptions([a15, a16])], [c31, c32])).
% 55.98/7.90
% 55.98/7.90 cnf(c34, plain,
% 55.98/7.90 $false,
% 55.98/7.90 inference(constraint_solving, [
% 55.98/7.90 bind(X0, sK63(X2)),
% 55.98/7.90 bind(X1, sK62(X4)),
% 55.98/7.90 bind(X2, sK64),
% 55.98/7.90 bind(X3, sK64),
% 55.98/7.90 bind(X4, sK65),
% 55.98/7.90 bind(X5, sK65),
% 55.98/7.90 bind(X6, xu),
% 55.98/7.90 bind(X7, sK65),
% 55.98/7.90 bind(X8, sK64)
% 55.98/7.90 ],
% 55.98/7.90 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16])).
% 55.98/7.90
% 55.98/7.90 % SZS output end IncompleteProof
%------------------------------------------------------------------------------