%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV405+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 : n008.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:48 EDT 2022 % Result : Theorem 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SWV405+1 : TPTP v8.1.0. Released v3.3.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 : n008.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 : Wed Jun 15 11:56:22 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 pair_in_list(create_slb,sK3,sK4) | ~check_cpq(triple(sK1,create_slb,sK2))). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 pair_in_list(create_slb,sK3,sK4) | ~check_cpq(triple(sK1,create_slb,sK2)), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 ~pair_in_list(create_slb,X0,X1)). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 create_slb = create_slb). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 sK3 = X0). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 sK4 = X1). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 ~check_cpq(triple(sK1,create_slb,sK2)), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 check_cpq(triple(X2,create_slb,X3))). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 triple(sK1,create_slb,sK2) = triple(X2,create_slb,X3)). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c3, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c3, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, sK3), % 0.12/0.34 bind(X1, sK4), % 0.12/0.34 bind(X2, sK1), % 0.12/0.34 bind(X3, sK2) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------