%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n007.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 : Wed Jul 20 19:46:47 EDT 2022 % Result : Theorem 0.22s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SWV397+1 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n007.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Wed Jun 15 18:31:41 EDT 2022 % 0.13/0.35 % CPUTime : % 0.22/0.36 % SZS status Theorem % 0.22/0.36 % SZS output begin IncompleteProof % 0.22/0.36 cnf(c0, axiom, % 0.22/0.36 ok(remove_cpq(triple(sK1,sK2,sK3),sK4))). % 0.22/0.36 cnf(c1, plain, % 0.22/0.36 ok(remove_cpq(triple(sK1,sK2,sK3),sK4)), % 0.22/0.36 inference(start, [], [c0])). % 0.22/0.36 % 0.22/0.36 cnf(c2, axiom, % 0.22/0.36 triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) | contains_slb(X1,X3)). % 0.22/0.36 cnf(a0, assumption, % 0.22/0.36 remove_cpq(triple(sK1,sK2,sK3),sK4) = remove_cpq(triple(X0,X1,X2),X3)). % 0.22/0.36 cnf(c3, plain, % 0.22/0.36 $false, % 0.22/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.22/0.36 cnf(c4, plain, % 0.22/0.36 contains_slb(X1,X3), % 0.22/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.22/0.36 cnf(c5, plain, % 0.22/0.36 X4 != triple(X0,X1,bad) | ok(X4), % 0.22/0.36 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.22/0.36 % 0.22/0.36 cnf(a1, assumption, % 0.22/0.36 X4 = triple(X0,X1,bad)). % 0.22/0.36 cnf(c6, plain, % 0.22/0.36 ok(X4), % 0.22/0.36 inference(reflexivity, [assumptions([a1])], [c5])). % 0.22/0.36 % 0.22/0.36 cnf(c7, axiom, % 0.22/0.36 ~ok(triple(X5,X6,bad))). % 0.22/0.36 cnf(a2, assumption, % 0.22/0.36 X4 = triple(X5,X6,bad)). % 0.22/0.36 cnf(c8, plain, % 0.22/0.36 $false, % 0.22/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c6, c7])). % 0.22/0.36 cnf(c9, plain, % 0.22/0.36 $false, % 0.22/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c6, c7])). % 0.22/0.36 % 0.22/0.36 cnf(c10, axiom, % 0.22/0.36 ~contains_slb(sK2,sK4)). % 0.22/0.36 cnf(a3, assumption, % 0.22/0.36 X1 = sK2). % 0.22/0.36 cnf(a4, assumption, % 0.22/0.36 X3 = sK4). % 0.22/0.36 cnf(c11, plain, % 0.22/0.36 $false, % 0.22/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c10])). % 0.22/0.36 cnf(c12, plain, % 0.22/0.36 $false, % 0.22/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c10])). % 0.22/0.36 % 0.22/0.36 cnf(c13, plain, % 0.22/0.36 $false, % 0.22/0.36 inference(constraint_solving, [ % 0.22/0.36 bind(X0, sK1), % 0.22/0.36 bind(X1, sK2), % 0.22/0.36 bind(X2, sK3), % 0.22/0.36 bind(X3, sK4), % 0.22/0.36 bind(X4, triple(X0,X1,bad)), % 0.22/0.36 bind(X5, sK1), % 0.22/0.36 bind(X6, sK2) % 0.22/0.36 ], % 0.22/0.36 [a0, a1, a2, a3, a4])). % 0.22/0.36 % 0.22/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------