%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : ALG171+1 : TPTP v8.1.0. Released v2.7.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n018.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 14 17:20:44 EDT 2022 % Result : Theorem 4.66s 0.95s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : ALG171+1 : TPTP v8.1.0. Released v2.7.0. % 0.00/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n018.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 8 19:06:07 EDT 2022 % 0.12/0.33 % CPUTime : % 4.66/0.95 % SZS status Theorem % 4.66/0.95 % SZS output begin IncompleteProof % 4.66/0.95 cnf(c0, axiom, % 4.66/0.95 e4 = op(e4,op(e4,e4))). % 4.66/0.95 cnf(c1, plain, % 4.66/0.95 e4 = op(e4,op(e4,e4)), % 4.66/0.95 inference(start, [], [c0])). % 4.66/0.95 % 4.66/0.95 cnf(c2, axiom, % 4.66/0.95 e0 = op(e4,op(e4,e4))). % 4.66/0.95 cnf(a0, assumption, % 4.66/0.95 op(e4,op(e4,e4)) = op(e4,op(e4,e4))). % 4.66/0.95 cnf(a1, assumption, % 4.66/0.95 e4 = X0). % 4.66/0.95 cnf(c3, plain, % 4.66/0.95 $false, % 4.66/0.95 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 4.66/0.95 cnf(c4, plain, % 4.66/0.95 $false, % 4.66/0.95 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 4.66/0.95 cnf(c5, plain, % 4.66/0.95 e0 = X0, % 4.66/0.95 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 4.66/0.95 % 4.66/0.95 cnf(c6, axiom, % 4.66/0.95 e0 != e4). % 4.66/0.95 cnf(a2, assumption, % 4.66/0.95 e0 = e0). % 4.66/0.95 cnf(c7, plain, % 4.66/0.95 $false, % 4.66/0.95 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 4.66/0.95 cnf(c8, plain, % 4.66/0.95 $false, % 4.66/0.95 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 4.66/0.95 cnf(c9, plain, % 4.66/0.95 X0 != e4, % 4.66/0.95 inference(strict_subterm_extension, [assumptions([a2])], [c5, c6])). % 4.66/0.95 % 4.66/0.95 cnf(a3, assumption, % 4.66/0.95 X0 = e4). % 4.66/0.95 cnf(c10, plain, % 4.66/0.95 $false, % 4.66/0.95 inference(reflexivity, [assumptions([a3])], [c9])). % 4.66/0.95 % 4.66/0.95 cnf(c11, plain, % 4.66/0.95 $false, % 4.66/0.95 inference(constraint_solving, [ % 4.66/0.95 bind(X0, e4) % 4.66/0.95 ], % 4.66/0.95 [a0, a1, a2, a3])). % 4.66/0.95 % 4.66/0.95 % SZS output end IncompleteProof %------------------------------------------------------------------------------