%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR115+82 : 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 : n017.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 : Fri Jul 15 20:37:45 EDT 2022 % Result : Theorem 0.20s 0.55s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : CSR115+82 : 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.13/0.34 % Computer : n017.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jun 10 23:00:50 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.55 % SZS status Theorem % 0.20/0.55 % SZS output begin IncompleteProof % 0.20/0.55 cnf(c0, axiom, % 0.20/0.55 ~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1)). % 0.20/0.55 cnf(c1, plain, % 0.20/0.55 ~sub(X0,name_1_1) | ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1), % 0.20/0.55 inference(start, [], [c0])). % 0.20/0.55 % 0.20/0.55 cnf(c2, axiom, % 0.20/0.55 sub(sK109(X6,X7),name_1_1) | ~sP46(X6,X7)). % 0.20/0.55 cnf(a0, assumption, % 0.20/0.55 X0 = sK109(X6,X7)). % 0.20/0.55 cnf(a1, assumption, % 0.20/0.55 name_1_1 = name_1_1). % 0.20/0.55 cnf(c3, plain, % 0.20/0.55 ~sub(X1,name_1_1) | ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1), % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.55 cnf(c4, plain, % 0.20/0.55 ~sP46(X6,X7), % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.55 % 0.20/0.55 cnf(c5, axiom, % 0.20/0.55 sP46(X8,X9) | ~name(X9,X8)). % 0.20/0.55 cnf(a2, assumption, % 0.20/0.55 X6 = X8). % 0.20/0.55 cnf(a3, assumption, % 0.20/0.55 X7 = X9). % 0.20/0.55 cnf(c6, plain, % 0.20/0.55 $false, % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.55 cnf(c7, plain, % 0.20/0.55 ~name(X9,X8), % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.55 % 0.20/0.55 cnf(c8, axiom, % 0.20/0.55 name(c358,freeride_____344ra_0)). % 0.20/0.55 cnf(a4, assumption, % 0.20/0.55 X9 = c358). % 0.20/0.55 cnf(a5, assumption, % 0.20/0.55 X8 = freeride_____344ra_0). % 0.20/0.55 cnf(c9, plain, % 0.20/0.55 $false, % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.55 cnf(c10, plain, % 0.20/0.55 $false, % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.55 % 0.20/0.55 cnf(c11, plain, % 0.20/0.55 sub(X0,name_1_1)). % 0.20/0.55 cnf(a6, assumption, % 0.20/0.55 X1 = X0). % 0.20/0.55 cnf(a7, assumption, % 0.20/0.55 name_1_1 = name_1_1). % 0.20/0.55 cnf(c12, plain, % 0.20/0.55 ~attr(X2,X3) | ~attr(X4,X0) | ~attr(X5,X1), % 0.20/0.55 inference(predicate_reduction, [assumptions([a6, a7])], [c3, c11])). % 0.20/0.55 % 0.20/0.55 cnf(c13, axiom, % 0.20/0.55 attr(c341,c342)). % 0.20/0.55 cnf(a8, assumption, % 0.20/0.55 X2 = c341). % 0.20/0.55 cnf(a9, assumption, % 0.20/0.55 X3 = c342). % 0.20/0.55 cnf(c14, plain, % 0.20/0.55 ~attr(X4,X0) | ~attr(X5,X1), % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 0.20/0.55 cnf(c15, plain, % 0.20/0.55 $false, % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 0.20/0.55 % 0.20/0.55 cnf(c16, axiom, % 0.20/0.55 attr(X10,sK109(X11,X10)) | ~sP46(X11,X10)). % 0.20/0.55 cnf(a10, assumption, % 0.20/0.55 X4 = X10). % 0.20/0.55 cnf(a11, assumption, % 0.20/0.55 X0 = sK109(X11,X10)). % 0.20/0.55 cnf(c17, plain, % 0.20/0.55 ~attr(X5,X1), % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])). % 0.20/0.55 cnf(c18, plain, % 0.20/0.55 ~sP46(X11,X10), % 0.20/0.55 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])). % 0.20/0.55 % 0.20/0.55 cnf(c19, plain, % 0.20/0.55 sP46(X6,X7)). % 0.20/0.55 cnf(a12, assumption, % 0.20/0.55 X11 = X6). % 0.20/0.55 cnf(a13, assumption, % 0.20/0.55 X10 = X7). % 0.20/0.55 cnf(c20, plain, % 0.20/0.55 $false, % 0.20/0.55 inference(predicate_reduction, [assumptions([a12, a13])], [c18, c19])). % 0.20/0.55 % 0.20/0.55 cnf(c21, plain, % 0.20/0.55 attr(X4,X0)). % 0.20/0.55 cnf(a14, assumption, % 0.20/0.55 X5 = X4). % 0.20/0.55 cnf(a15, assumption, % 0.20/0.55 X1 = X0). % 0.20/0.55 cnf(c22, plain, % 0.20/0.55 $false, % 0.20/0.55 inference(predicate_reduction, [assumptions([a14, a15])], [c17, c21])). % 0.20/0.55 % 0.20/0.55 cnf(c23, plain, % 0.20/0.55 $false, % 0.20/0.55 inference(constraint_solving, [ % 0.20/0.55 bind(X0, sK109(X6,X7)), % 0.20/0.55 bind(X1, sK109(X6,X7)), % 0.20/0.55 bind(X2, c341), % 0.20/0.55 bind(X3, c342), % 0.20/0.55 bind(X4, c358), % 0.20/0.55 bind(X5, c358), % 0.20/0.55 bind(X6, freeride_____344ra_0), % 0.20/0.55 bind(X7, c358), % 0.20/0.55 bind(X8, freeride_____344ra_0), % 0.20/0.55 bind(X9, c358), % 0.20/0.55 bind(X10, c358), % 0.20/0.55 bind(X11, freeride_____344ra_0) % 0.20/0.55 ], % 0.20/0.55 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.20/0.55 % 0.20/0.55 % SZS output end IncompleteProof %------------------------------------------------------------------------------