TSTP Solution File: RNG061+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : RNG061+2 : 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 : n032.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:28 EDT 2022
% Result : Theorem 31.50s 4.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : RNG061+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon May 30 16:32:12 EDT 2022
% 0.10/0.29 % CPUTime :
% 31.50/4.38 % SZS status Theorem
% 31.50/4.38 % SZS output begin IncompleteProof
% 31.50/4.38 cnf(c0, axiom,
% 31.50/4.38 sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))).
% 31.50/4.38 cnf(c1, plain,
% 31.50/4.38 sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
% 31.50/4.38 inference(start, [], [c0])).
% 31.50/4.38
% 31.50/4.38 cnf(c2, axiom,
% 31.50/4.38 sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))).
% 31.50/4.38 cnf(a0, assumption,
% 31.50/4.38 sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS))) = sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))).
% 31.50/4.38 cnf(c3, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 31.50/4.38 cnf(c4, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 31.50/4.38 cnf(c5, plain,
% 31.50/4.38 X0 != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))) | X0 != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
% 31.50/4.38 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 31.50/4.38
% 31.50/4.38 cnf(a1, assumption,
% 31.50/4.38 X0 = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))).
% 31.50/4.38 cnf(c6, plain,
% 31.50/4.38 X0 != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),
% 31.50/4.38 inference(reflexivity, [assumptions([a1])], [c5])).
% 31.50/4.38
% 31.50/4.38 cnf(c7, axiom,
% 31.50/4.38 sdtpldt0(X1,X2) = sdtpldt0(X2,X1) | ~sP1(X1,X2,X3)).
% 31.50/4.38 cnf(a2, assumption,
% 31.50/4.38 sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)) = sdtpldt0(X1,X2)).
% 31.50/4.38 cnf(c8, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 31.50/4.38 cnf(c9, plain,
% 31.50/4.38 ~sP1(X1,X2,X3),
% 31.50/4.38 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 31.50/4.38 cnf(c10, plain,
% 31.50/4.38 X4 != sdtpldt0(X2,X1) | X0 != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),X4),
% 31.50/4.38 inference(strict_function_extension, [assumptions([a2])], [c6, c7])).
% 31.50/4.38
% 31.50/4.38 cnf(a3, assumption,
% 31.50/4.38 X4 = sdtpldt0(X2,X1)).
% 31.50/4.38 cnf(c11, plain,
% 31.50/4.38 X0 != sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),X4),
% 31.50/4.38 inference(reflexivity, [assumptions([a3])], [c10])).
% 31.50/4.38
% 31.50/4.38 cnf(a4, assumption,
% 31.50/4.38 X0 = sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),X4)).
% 31.50/4.38 cnf(c12, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(reflexivity, [assumptions([a4])], [c11])).
% 31.50/4.38
% 31.50/4.38 cnf(c13, axiom,
% 31.50/4.38 sP1(X5,X6,X7) | ~aScalar0(X7) | ~aScalar0(X6) | ~aScalar0(X5)).
% 31.50/4.38 cnf(a5, assumption,
% 31.50/4.38 X1 = X5).
% 31.50/4.38 cnf(a6, assumption,
% 31.50/4.38 X2 = X6).
% 31.50/4.38 cnf(a7, assumption,
% 31.50/4.38 X3 = X7).
% 31.50/4.38 cnf(c14, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c9, c13])).
% 31.50/4.38 cnf(c15, plain,
% 31.50/4.38 ~aScalar0(X7) | ~aScalar0(X6) | ~aScalar0(X5),
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c9, c13])).
% 31.50/4.38
% 31.50/4.38 cnf(c16, axiom,
% 31.50/4.38 aScalar0(xS)).
% 31.50/4.38 cnf(a8, assumption,
% 31.50/4.38 X7 = xS).
% 31.50/4.38 cnf(c17, plain,
% 31.50/4.38 ~aScalar0(X6) | ~aScalar0(X5),
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a8])], [c15, c16])).
% 31.50/4.38 cnf(c18, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a8])], [c15, c16])).
% 31.50/4.38
% 31.50/4.38 cnf(c19, axiom,
% 31.50/4.38 aScalar0(smndt0(X8)) | ~aScalar0(X8)).
% 31.50/4.38 cnf(a9, assumption,
% 31.50/4.38 X6 = smndt0(X8)).
% 31.50/4.38 cnf(c20, plain,
% 31.50/4.38 ~aScalar0(X5),
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a9])], [c17, c19])).
% 31.50/4.38 cnf(c21, plain,
% 31.50/4.38 ~aScalar0(X8),
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a9])], [c17, c19])).
% 31.50/4.38
% 31.50/4.38 cnf(c22, axiom,
% 31.50/4.38 aScalar0(xN)).
% 31.50/4.38 cnf(a10, assumption,
% 31.50/4.38 X8 = xN).
% 31.50/4.38 cnf(c23, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a10])], [c21, c22])).
% 31.50/4.38 cnf(c24, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a10])], [c21, c22])).
% 31.50/4.38
% 31.50/4.38 cnf(c25, axiom,
% 31.50/4.38 aScalar0(sdtasdt0(X9,X10)) | ~aScalar0(X10) | ~aScalar0(X9)).
% 31.50/4.38 cnf(a11, assumption,
% 31.50/4.38 X5 = sdtasdt0(X9,X10)).
% 31.50/4.38 cnf(c26, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a11])], [c20, c25])).
% 31.50/4.38 cnf(c27, plain,
% 31.50/4.38 ~aScalar0(X10) | ~aScalar0(X9),
% 31.50/4.38 inference(strict_predicate_extension, [assumptions([a11])], [c20, c25])).
% 31.50/4.38
% 31.50/4.38 cnf(c28, plain,
% 31.50/4.38 aScalar0(X7)).
% 31.50/4.38 cnf(a12, assumption,
% 31.50/4.38 X10 = X7).
% 31.50/4.38 cnf(c29, plain,
% 31.50/4.38 ~aScalar0(X9),
% 31.50/4.38 inference(predicate_reduction, [assumptions([a12])], [c27, c28])).
% 31.50/4.38
% 31.50/4.38 cnf(c30, plain,
% 31.50/4.38 aScalar0(X7)).
% 31.50/4.38 cnf(a13, assumption,
% 31.50/4.38 X9 = X7).
% 31.50/4.38 cnf(c31, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(predicate_reduction, [assumptions([a13])], [c29, c30])).
% 31.50/4.38
% 31.50/4.38 cnf(c32, plain,
% 31.50/4.38 $false,
% 31.50/4.38 inference(constraint_solving, [
% 31.50/4.38 bind(X0, sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),
% 31.50/4.38 bind(X1, sdtasdt0(xS,xS)),
% 31.50/4.38 bind(X2, smndt0(xN)),
% 31.50/4.38 bind(X3, xS),
% 31.50/4.38 bind(X4, sdtpldt0(X2,X1)),
% 31.50/4.38 bind(X5, sdtasdt0(xS,xS)),
% 31.50/4.38 bind(X6, smndt0(xN)),
% 31.50/4.38 bind(X7, xS),
% 31.50/4.38 bind(X8, xN),
% 31.50/4.38 bind(X9, xS),
% 31.50/4.38 bind(X10, xS)
% 31.50/4.38 ],
% 31.50/4.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 31.50/4.38
% 31.50/4.38 % SZS output end IncompleteProof
%------------------------------------------------------------------------------