%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR113+20 : 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 : n026.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:22 EDT 2022 % Result : Theorem 3.44s 0.94s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : CSR113+20 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n026.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 : Sat Jun 11 04:07:49 EDT 2022 % 0.12/0.33 % CPUTime : % 3.44/0.94 % SZS status Theorem % 3.44/0.94 % SZS output begin IncompleteProof % 3.44/0.94 cnf(c0, axiom, % 3.44/0.94 ~val(X0,new_york_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~flp(X3,X4)). % 3.44/0.94 cnf(c1, plain, % 3.44/0.94 ~val(X0,new_york_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~flp(X3,X4), % 3.44/0.94 inference(start, [], [c0])). % 3.44/0.94 % 3.44/0.94 cnf(c2, axiom, % 3.44/0.94 val(c2596,new_york_0)). % 3.44/0.94 cnf(a0, assumption, % 3.44/0.94 X0 = c2596). % 3.44/0.94 cnf(a1, assumption, % 3.44/0.94 new_york_0 = new_york_0). % 3.44/0.94 cnf(c3, plain, % 3.44/0.94 ~sub(X0,name_1_1) | ~scar(X1,X2) | ~flp(X3,X4), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.44/0.94 cnf(c4, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.44/0.94 % 3.44/0.94 cnf(c5, axiom, % 3.44/0.94 sub(c2596,name_1_1)). % 3.44/0.94 cnf(a2, assumption, % 3.44/0.94 X0 = c2596). % 3.44/0.94 cnf(a3, assumption, % 3.44/0.94 name_1_1 = name_1_1). % 3.44/0.94 cnf(c6, plain, % 3.44/0.94 ~scar(X1,X2) | ~flp(X3,X4), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 3.44/0.94 cnf(c7, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])). % 3.44/0.94 % 3.44/0.94 cnf(c8, axiom, % 3.44/0.94 scar(sK100(X5),X5) | ~sP36(X5)). % 3.44/0.94 cnf(a4, assumption, % 3.44/0.94 X1 = sK100(X5)). % 3.44/0.94 cnf(a5, assumption, % 3.44/0.94 X2 = X5). % 3.44/0.94 cnf(c9, plain, % 3.44/0.94 ~flp(X3,X4), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 3.44/0.94 cnf(c10, plain, % 3.44/0.94 ~sP36(X5), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 3.44/0.94 % 3.44/0.94 cnf(c11, axiom, % 3.44/0.94 sP36(X6) | ~sub(X7,X8) | ~member(X8,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X6,X7)). % 3.44/0.94 cnf(a6, assumption, % 3.44/0.94 X5 = X6). % 3.44/0.94 cnf(c12, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])). % 3.44/0.94 cnf(c13, plain, % 3.44/0.94 ~sub(X7,X8) | ~member(X8,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X6,X7), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])). % 3.44/0.94 % 3.44/0.94 cnf(c14, plain, % 3.44/0.94 sub(X0,name_1_1)). % 3.44/0.94 cnf(a7, assumption, % 3.44/0.94 X7 = X0). % 3.44/0.94 cnf(a8, assumption, % 3.44/0.94 X8 = name_1_1). % 3.44/0.94 cnf(c15, plain, % 3.44/0.94 ~member(X8,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X6,X7), % 3.44/0.94 inference(predicate_reduction, [assumptions([a7, a8])], [c13, c14])). % 3.44/0.94 % 3.44/0.94 cnf(c16, axiom, % 3.44/0.94 member(X9,cons(X10,X11)) | ~member(X9,X11)). % 3.44/0.94 cnf(a9, assumption, % 3.44/0.94 X8 = X9). % 3.44/0.94 cnf(a10, assumption, % 3.44/0.94 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X10,X11)). % 3.44/0.94 cnf(c17, plain, % 3.44/0.94 ~attr(X6,X7), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])). % 3.44/0.94 cnf(c18, plain, % 3.44/0.94 ~member(X9,X11), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])). % 3.44/0.94 % 3.44/0.94 cnf(c19, axiom, % 3.44/0.94 member(X12,cons(X13,X14)) | ~member(X12,X14)). % 3.44/0.94 cnf(a11, assumption, % 3.44/0.94 X9 = X12). % 3.44/0.94 cnf(a12, assumption, % 3.44/0.94 X11 = cons(X13,X14)). % 3.44/0.94 cnf(c20, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])). % 3.44/0.94 cnf(c21, plain, % 3.44/0.94 ~member(X12,X14), % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])). % 3.44/0.94 % 3.44/0.94 cnf(c22, axiom, % 3.44/0.94 member(X15,cons(X15,X16))). % 3.44/0.94 cnf(a13, assumption, % 3.44/0.94 X12 = X15). % 3.44/0.94 cnf(a14, assumption, % 3.44/0.94 X14 = cons(X15,X16)). % 3.44/0.94 cnf(c23, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])). % 3.44/0.94 cnf(c24, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])). % 3.44/0.94 % 3.44/0.94 cnf(c25, axiom, % 3.44/0.94 attr(c2595,c2596)). % 3.44/0.94 cnf(a15, assumption, % 3.44/0.94 X6 = c2595). % 3.44/0.94 cnf(a16, assumption, % 3.44/0.94 X7 = c2596). % 3.44/0.94 cnf(c26, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a15, a16])], [c17, c25])). % 3.44/0.94 cnf(c27, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a15, a16])], [c17, c25])). % 3.44/0.94 % 3.44/0.94 cnf(c28, axiom, % 3.44/0.94 flp(c3577,c3439)). % 3.44/0.94 cnf(a17, assumption, % 3.44/0.94 X3 = c3577). % 3.44/0.94 cnf(a18, assumption, % 3.44/0.94 X4 = c3439). % 3.44/0.94 cnf(c29, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a17, a18])], [c9, c28])). % 3.44/0.94 cnf(c30, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(strict_predicate_extension, [assumptions([a17, a18])], [c9, c28])). % 3.44/0.94 % 3.44/0.94 cnf(c31, plain, % 3.44/0.94 $false, % 3.44/0.94 inference(constraint_solving, [ % 3.44/0.94 bind(X0, c2596), % 3.44/0.94 bind(X1, sK100(X5)), % 3.44/0.94 bind(X2, c2595), % 3.44/0.94 bind(X3, c3577), % 3.44/0.94 bind(X4, c3439), % 3.44/0.94 bind(X5, c2595), % 3.44/0.94 bind(X6, c2595), % 3.44/0.94 bind(X7, c2596), % 3.44/0.94 bind(X8, name_1_1), % 3.44/0.94 bind(X9, name_1_1), % 3.44/0.94 bind(X10, eigenname_1_1), % 3.44/0.94 bind(X11, cons(familiename_1_1,cons(name_1_1,nil))), % 3.44/0.95 bind(X12, name_1_1), % 3.44/0.95 bind(X13, familiename_1_1), % 3.44/0.95 bind(X14, cons(name_1_1,nil)), % 3.44/0.95 bind(X15, name_1_1), % 3.44/0.95 bind(X16, nil) % 3.44/0.95 ], % 3.44/0.95 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 3.44/0.95 % 3.44/0.95 % SZS output end IncompleteProof %------------------------------------------------------------------------------