%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWW469+5 : TPTP v8.1.0. Released v5.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 : n021.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 : Thu Jul 21 00:45:53 EDT 2022 % Result : Theorem 2.12s 0.65s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SWW469+5 : TPTP v8.1.0. Released v5.3.0. % 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.36 % Computer : n021.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Sat Jun 4 20:57:49 EDT 2022 % 0.14/0.36 % CPUTime : % 2.12/0.65 % SZS status Theorem % 2.12/0.65 % SZS output begin IncompleteProof % 2.12/0.65 cnf(c0, axiom, % 2.12/0.65 ti(state,X0) = ti(state,sK11)). % 2.12/0.65 cnf(c1, plain, % 2.12/0.65 ti(state,X0) = ti(state,sK11), % 2.12/0.65 inference(start, [], [c0])). % 2.12/0.65 % 2.12/0.65 cnf(c2, axiom, % 2.12/0.65 ti(state,X1) = ti(state,sK11)). % 2.12/0.65 cnf(a0, assumption, % 2.12/0.65 ti(state,sK11) = ti(state,sK11)). % 2.12/0.65 cnf(a1, assumption, % 2.12/0.65 ti(state,X0) = X2). % 2.12/0.65 cnf(c3, plain, % 2.12/0.65 $false, % 2.12/0.65 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.12/0.65 cnf(c4, plain, % 2.12/0.65 $false, % 2.12/0.65 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.12/0.65 cnf(c5, plain, % 2.12/0.65 ti(state,X1) = X2, % 2.12/0.65 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 2.12/0.65 % 2.12/0.65 cnf(c6, axiom, % 2.12/0.65 ti(state,sK0) != ti(state,sK1) | ~hBOOL(hoare_1883395792gleton)). % 2.12/0.65 cnf(a2, assumption, % 2.12/0.65 ti(state,sK1) = X2). % 2.12/0.65 cnf(a3, assumption, % 2.12/0.65 ti(state,X1) = X3). % 2.12/0.65 cnf(c7, plain, % 2.12/0.65 $false, % 2.12/0.65 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 2.12/0.65 cnf(c8, plain, % 2.12/0.65 ~hBOOL(hoare_1883395792gleton), % 2.12/0.65 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 2.12/0.65 cnf(c9, plain, % 2.12/0.65 ti(state,sK0) != X3, % 2.12/0.65 inference(strict_subterm_extension, [assumptions([a2, a3])], [c5, c6])). % 2.12/0.65 % 2.12/0.65 cnf(a4, assumption, % 2.12/0.65 ti(state,sK0) = X3). % 2.12/0.65 cnf(c10, plain, % 2.12/0.65 $false, % 2.12/0.65 inference(reflexivity, [assumptions([a4])], [c9])). % 2.12/0.65 % 2.12/0.65 cnf(c11, axiom, % 2.12/0.65 hBOOL(hoare_1883395792gleton)). % 2.12/0.65 cnf(a5, assumption, % 2.12/0.65 hoare_1883395792gleton = hoare_1883395792gleton). % 2.12/0.65 cnf(c12, plain, % 2.12/0.65 $false, % 2.12/0.65 inference(strict_predicate_extension, [assumptions([a5])], [c8, c11])). % 2.12/0.65 cnf(c13, plain, % 2.12/0.65 $false, % 2.12/0.65 inference(strict_predicate_extension, [assumptions([a5])], [c8, c11])). % 2.12/0.65 % 2.12/0.65 cnf(c14, plain, % 2.12/0.65 $false, % 2.12/0.65 inference(constraint_solving, [ % 2.12/0.65 bind(X0, sK1), % 2.12/0.65 bind(X1, sK0), % 2.12/0.65 bind(X2, ti(state,X0)), % 2.12/0.65 bind(X3, ti(state,X1)) % 2.12/0.65 ], % 2.12/0.65 [a0, a1, a2, a3, a4, a5])). % 2.12/0.65 % 2.12/0.65 % SZS output end IncompleteProof %------------------------------------------------------------------------------