%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.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 : Sat Jul 16 04:58:53 EDT 2022 % Result : Theorem 0.19s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GEO085+1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.12 % 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 : Sat Jun 18 10:07:02 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.36 % SZS status Theorem % 0.19/0.36 % SZS output begin IncompleteProof % 0.19/0.36 cnf(c0, axiom, % 0.19/0.36 open(sK17)). % 0.19/0.36 cnf(c1, plain, % 0.19/0.36 open(sK17), % 0.19/0.36 inference(start, [], [c0])). % 0.19/0.36 % 0.19/0.36 cnf(c2, axiom, % 0.19/0.36 end_point(sK10(X0),X0) | ~open(X0)). % 0.19/0.36 cnf(a0, assumption, % 0.19/0.36 sK17 = X0). % 0.19/0.36 cnf(c3, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.36 cnf(c4, plain, % 0.19/0.36 end_point(sK10(X0),X0), % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.36 % 0.19/0.36 cnf(c5, axiom, % 0.19/0.36 ~end_point(X1,sK17) | ~end_point(X2,sK17) | X2 = X1). % 0.19/0.36 cnf(a1, assumption, % 0.19/0.36 sK10(X0) = X2). % 0.19/0.36 cnf(a2, assumption, % 0.19/0.36 X0 = sK17). % 0.19/0.36 cnf(c6, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.19/0.36 cnf(c7, plain, % 0.19/0.36 ~end_point(X1,sK17) | X2 = X1, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.19/0.36 % 0.19/0.36 cnf(c8, axiom, % 0.19/0.36 end_point(sK14(X3,X4),X3) | ~end_point(X4,X3)). % 0.19/0.36 cnf(a3, assumption, % 0.19/0.36 X1 = sK14(X3,X4)). % 0.19/0.36 cnf(a4, assumption, % 0.19/0.36 sK17 = X3). % 0.19/0.36 cnf(c9, plain, % 0.19/0.36 X2 = X1, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.19/0.36 cnf(c10, plain, % 0.19/0.36 ~end_point(X4,X3), % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.19/0.36 % 0.19/0.36 cnf(c11, plain, % 0.19/0.36 end_point(sK10(X0),X0)). % 0.19/0.36 cnf(a5, assumption, % 0.19/0.36 X4 = sK10(X0)). % 0.19/0.36 cnf(a6, assumption, % 0.19/0.36 X3 = X0). % 0.19/0.36 cnf(c12, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [assumptions([a5, a6])], [c10, c11])). % 0.19/0.36 % 0.19/0.36 cnf(c13, axiom, % 0.19/0.36 sK14(X5,X6) != X6 | ~end_point(X6,X5)). % 0.19/0.36 cnf(a7, assumption, % 0.19/0.36 sK14(X5,X6) = X1). % 0.19/0.36 cnf(c14, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_subterm_extension, [assumptions([a7])], [c9, c13])). % 0.19/0.36 cnf(c15, plain, % 0.19/0.36 ~end_point(X6,X5), % 0.19/0.36 inference(strict_subterm_extension, [assumptions([a7])], [c9, c13])). % 0.19/0.36 cnf(c16, plain, % 0.19/0.36 X2 != X6, % 0.19/0.36 inference(strict_subterm_extension, [assumptions([a7])], [c9, c13])). % 0.19/0.36 % 0.19/0.36 cnf(a8, assumption, % 0.19/0.36 X2 = X6). % 0.19/0.36 cnf(c17, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(reflexivity, [assumptions([a8])], [c16])). % 0.19/0.36 % 0.19/0.36 cnf(c18, plain, % 0.19/0.36 end_point(sK10(X0),X0)). % 0.19/0.36 cnf(a9, assumption, % 0.19/0.36 X6 = sK10(X0)). % 0.19/0.36 cnf(a10, assumption, % 0.19/0.36 X5 = X0). % 0.19/0.36 cnf(c19, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [assumptions([a9, a10])], [c15, c18])). % 0.19/0.36 % 0.19/0.36 cnf(c20, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(constraint_solving, [ % 0.19/0.36 bind(X0, sK17), % 0.19/0.36 bind(X1, sK14(X3,X4)), % 0.19/0.36 bind(X2, sK10(X0)), % 0.19/0.36 bind(X3, sK17), % 0.19/0.36 bind(X4, sK10(X0)), % 0.19/0.36 bind(X5, sK17), % 0.19/0.36 bind(X6, sK10(X0)) % 0.19/0.36 ], % 0.19/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.19/0.36 % 0.19/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------