TSTP Solution File: RNG046+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : RNG046+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 : n020.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:26 EDT 2022
% Result : Theorem 9.31s 1.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG046+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n020.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 : Mon May 30 18:17:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 9.31/1.53 % SZS status Theorem
% 9.31/1.53 % SZS output begin IncompleteProof
% 9.31/1.53 cnf(c0, axiom,
% 9.31/1.53 sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy)).
% 9.31/1.53 cnf(c1, plain,
% 9.31/1.53 sdtasdt0(smndt0(xx),smndt0(xy)) != sdtasdt0(xx,xy),
% 9.31/1.53 inference(start, [], [c0])).
% 9.31/1.53
% 9.31/1.53 cnf(c2, axiom,
% 9.31/1.53 sdtasdt0(X0,smndt0(X1)) = smndt0(sdtasdt0(X0,X1)) | ~aScalar0(X1) | ~aScalar0(X0)).
% 9.31/1.53 cnf(a0, assumption,
% 9.31/1.53 sdtasdt0(smndt0(xx),smndt0(xy)) = sdtasdt0(X0,smndt0(X1))).
% 9.31/1.53 cnf(c3, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 9.31/1.53 cnf(c4, plain,
% 9.31/1.53 ~aScalar0(X1) | ~aScalar0(X0),
% 9.31/1.53 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 9.31/1.53 cnf(c5, plain,
% 9.31/1.53 X2 != smndt0(sdtasdt0(X0,X1)) | X2 != sdtasdt0(xx,xy),
% 9.31/1.53 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 9.31/1.53
% 9.31/1.53 cnf(c6, axiom,
% 9.31/1.53 smndt0(sdtasdt0(X3,X4)) = sdtasdt0(smndt0(X3),X4) | ~aScalar0(X4) | ~aScalar0(X3)).
% 9.31/1.53 cnf(a1, assumption,
% 9.31/1.53 smndt0(sdtasdt0(X0,X1)) = smndt0(sdtasdt0(X3,X4))).
% 9.31/1.53 cnf(c7, plain,
% 9.31/1.53 X2 != sdtasdt0(xx,xy),
% 9.31/1.53 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 9.31/1.53 cnf(c8, plain,
% 9.31/1.53 ~aScalar0(X4) | ~aScalar0(X3),
% 9.31/1.53 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 9.31/1.53 cnf(c9, plain,
% 9.31/1.53 X5 != sdtasdt0(smndt0(X3),X4) | X2 != X5,
% 9.31/1.53 inference(strict_function_extension, [assumptions([a1])], [c5, c6])).
% 9.31/1.53
% 9.31/1.53 cnf(c10, axiom,
% 9.31/1.53 smndt0(smndt0(X6)) = X6 | ~sP0(X6)).
% 9.31/1.53 cnf(a2, assumption,
% 9.31/1.53 smndt0(X3) = smndt0(smndt0(X6))).
% 9.31/1.53 cnf(c11, plain,
% 9.31/1.53 X2 != X5,
% 9.31/1.53 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 9.31/1.53 cnf(c12, plain,
% 9.31/1.53 ~sP0(X6),
% 9.31/1.53 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 9.31/1.53 cnf(c13, plain,
% 9.31/1.53 X7 != X6 | X5 != sdtasdt0(X7,X4),
% 9.31/1.53 inference(strict_function_extension, [assumptions([a2])], [c9, c10])).
% 9.31/1.53
% 9.31/1.53 cnf(a3, assumption,
% 9.31/1.53 X7 = X6).
% 9.31/1.53 cnf(c14, plain,
% 9.31/1.53 X5 != sdtasdt0(X7,X4),
% 9.31/1.53 inference(reflexivity, [assumptions([a3])], [c13])).
% 9.31/1.53
% 9.31/1.53 cnf(a4, assumption,
% 9.31/1.53 X5 = sdtasdt0(X7,X4)).
% 9.31/1.53 cnf(c15, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(reflexivity, [assumptions([a4])], [c14])).
% 9.31/1.53
% 9.31/1.53 cnf(c16, axiom,
% 9.31/1.53 sP0(X8) | ~aScalar0(X8)).
% 9.31/1.53 cnf(a5, assumption,
% 9.31/1.53 X6 = X8).
% 9.31/1.53 cnf(c17, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a5])], [c12, c16])).
% 9.31/1.53 cnf(c18, plain,
% 9.31/1.53 ~aScalar0(X8),
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a5])], [c12, c16])).
% 9.31/1.53
% 9.31/1.53 cnf(c19, axiom,
% 9.31/1.53 aScalar0(xx)).
% 9.31/1.53 cnf(a6, assumption,
% 9.31/1.53 X8 = xx).
% 9.31/1.53 cnf(c20, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])).
% 9.31/1.53 cnf(c21, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])).
% 9.31/1.53
% 9.31/1.53 cnf(a7, assumption,
% 9.31/1.53 X2 = X5).
% 9.31/1.53 cnf(c22, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(reflexivity, [assumptions([a7])], [c11])).
% 9.31/1.53
% 9.31/1.53 cnf(c23, axiom,
% 9.31/1.53 aScalar0(xy)).
% 9.31/1.53 cnf(a8, assumption,
% 9.31/1.53 X4 = xy).
% 9.31/1.53 cnf(c24, plain,
% 9.31/1.53 ~aScalar0(X3),
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a8])], [c8, c23])).
% 9.31/1.53 cnf(c25, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a8])], [c8, c23])).
% 9.31/1.53
% 9.31/1.53 cnf(c26, axiom,
% 9.31/1.53 aScalar0(smndt0(X9)) | ~aScalar0(X9)).
% 9.31/1.53 cnf(a9, assumption,
% 9.31/1.53 X3 = smndt0(X9)).
% 9.31/1.53 cnf(c27, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a9])], [c24, c26])).
% 9.31/1.53 cnf(c28, plain,
% 9.31/1.53 ~aScalar0(X9),
% 9.31/1.53 inference(strict_predicate_extension, [assumptions([a9])], [c24, c26])).
% 9.31/1.53
% 9.31/1.53 cnf(c29, plain,
% 9.31/1.53 aScalar0(X8)).
% 9.31/1.53 cnf(a10, assumption,
% 9.31/1.53 X9 = X8).
% 9.31/1.53 cnf(c30, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(predicate_reduction, [assumptions([a10])], [c28, c29])).
% 9.31/1.53
% 9.31/1.53 cnf(a11, assumption,
% 9.31/1.53 X2 = sdtasdt0(xx,xy)).
% 9.31/1.53 cnf(c31, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(reflexivity, [assumptions([a11])], [c7])).
% 9.31/1.53
% 9.31/1.53 cnf(c32, plain,
% 9.31/1.53 aScalar0(X4)).
% 9.31/1.53 cnf(a12, assumption,
% 9.31/1.53 X1 = X4).
% 9.31/1.53 cnf(c33, plain,
% 9.31/1.53 ~aScalar0(X0),
% 9.31/1.53 inference(predicate_reduction, [assumptions([a12])], [c4, c32])).
% 9.31/1.53
% 9.31/1.53 cnf(c34, plain,
% 9.31/1.53 aScalar0(X3)).
% 9.31/1.53 cnf(a13, assumption,
% 9.31/1.53 X0 = X3).
% 9.31/1.53 cnf(c35, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(predicate_reduction, [assumptions([a13])], [c33, c34])).
% 9.31/1.53
% 9.31/1.53 cnf(c36, plain,
% 9.31/1.53 $false,
% 9.31/1.53 inference(constraint_solving, [
% 9.31/1.53 bind(X0, smndt0(xx)),
% 9.31/1.53 bind(X1, xy),
% 9.31/1.53 bind(X2, sdtasdt0(X7,X4)),
% 9.31/1.53 bind(X3, smndt0(xx)),
% 9.31/1.53 bind(X4, xy),
% 9.31/1.53 bind(X5, sdtasdt0(X7,X4)),
% 9.31/1.53 bind(X6, xx),
% 9.31/1.53 bind(X7, xx),
% 9.31/1.53 bind(X8, xx),
% 9.31/1.53 bind(X9, xx)
% 9.31/1.53 ],
% 9.31/1.53 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 9.31/1.53
% 9.31/1.53 % SZS output end IncompleteProof
%------------------------------------------------------------------------------