%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC142+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n027.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 : Tue Jul 19 21:07:22 EDT 2022 % Result : Theorem 0.15s 0.33s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SWC142+1 : TPTP v8.1.0. Released v2.4.0. % 0.08/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.31 % Computer : n027.cluster.edu % 0.09/0.31 % Model : x86_64 x86_64 % 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.31 % Memory : 8042.1875MB % 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.31 % CPULimit : 300 % 0.09/0.31 % WCLimit : 600 % 0.09/0.31 % DateTime : Sun Jun 12 03:21:45 EDT 2022 % 0.09/0.31 % CPUTime : % 0.15/0.33 % SZS status Theorem % 0.15/0.33 % SZS output begin IncompleteProof % 0.15/0.33 cnf(c0, axiom, % 0.15/0.33 sK89 = sK91). % 0.15/0.33 cnf(c1, plain, % 0.15/0.33 sK89 = sK91, % 0.15/0.33 inference(start, [], [c0])). % 0.15/0.33 % 0.15/0.33 cnf(c2, axiom, % 0.15/0.33 neq(sK89,nil)). % 0.15/0.33 cnf(a0, assumption, % 0.15/0.33 sK89 = sK89). % 0.15/0.33 cnf(a1, assumption, % 0.15/0.33 sK91 = X0). % 0.15/0.33 cnf(c3, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.33 cnf(c4, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.33 cnf(c5, plain, % 0.15/0.33 neq(X0,nil), % 0.15/0.33 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.33 % 0.15/0.33 cnf(c6, axiom, % 0.15/0.33 ~neq(sK91,nil)). % 0.15/0.33 cnf(a2, assumption, % 0.15/0.33 X0 = sK91). % 0.15/0.33 cnf(a3, assumption, % 0.15/0.33 nil = nil). % 0.15/0.33 cnf(c7, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.15/0.33 cnf(c8, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c5, c6])). % 0.15/0.33 % 0.15/0.33 cnf(c9, plain, % 0.15/0.33 $false, % 0.15/0.33 inference(constraint_solving, [ % 0.15/0.33 bind(X0, sK91) % 0.15/0.33 ], % 0.15/0.33 [a0, a1, a2, a3])). % 0.15/0.33 % 0.15/0.33 % SZS output end IncompleteProof %------------------------------------------------------------------------------