%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV388+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 : n005.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:45 EDT 2022 % Result : Theorem 0.14s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SWV388+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n005.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue Jun 14 20:00:24 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.36 % SZS status Theorem % 0.14/0.36 % SZS output begin IncompleteProof % 0.14/0.36 cnf(c0, axiom, % 0.14/0.36 ~check_cpq(triple(sK1,sK2,sK3))). % 0.14/0.36 cnf(c1, plain, % 0.14/0.36 ~check_cpq(triple(sK1,sK2,sK3)), % 0.14/0.36 inference(start, [], [c0])). % 0.14/0.36 % 0.14/0.36 cnf(c2, axiom, % 0.14/0.36 ~check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) | check_cpq(triple(X0,X1,X2))). % 0.14/0.36 cnf(a0, assumption, % 0.14/0.36 triple(sK1,sK2,sK3) = triple(X0,X1,X2)). % 0.14/0.36 cnf(c3, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.36 cnf(c4, plain, % 0.14/0.36 ~check_cpq(findmin_cpq_eff(triple(X0,X1,X2))), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.36 % 0.14/0.36 cnf(c5, axiom, % 0.14/0.36 check_cpq(findmin_cpq_eff(triple(sK1,sK2,sK3)))). % 0.14/0.36 cnf(a1, assumption, % 0.14/0.36 findmin_cpq_eff(triple(X0,X1,X2)) = findmin_cpq_eff(triple(sK1,sK2,sK3))). % 0.14/0.36 cnf(c6, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.14/0.36 cnf(c7, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.14/0.36 % 0.14/0.36 cnf(c8, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(constraint_solving, [ % 0.14/0.36 bind(X0, sK1), % 0.14/0.36 bind(X1, sK2), % 0.14/0.36 bind(X2, sK3) % 0.14/0.36 ], % 0.14/0.36 [a0, a1])). % 0.14/0.36 % 0.14/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------