%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC262+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 : n032.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:57 EDT 2022 % Result : Theorem 0.12s 0.29s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : SWC262+1 : TPTP v8.1.0. Released v2.4.0. % 0.00/0.08 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.07/0.27 % Computer : n032.cluster.edu % 0.07/0.27 % Model : x86_64 x86_64 % 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.27 % Memory : 8042.1875MB % 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.27 % CPULimit : 300 % 0.07/0.27 % WCLimit : 600 % 0.07/0.27 % DateTime : Sat Jun 11 20:54:40 EDT 2022 % 0.07/0.27 % CPUTime : % 0.12/0.29 % SZS status Theorem % 0.12/0.29 % SZS output begin IncompleteProof % 0.12/0.29 cnf(c0, axiom, % 0.12/0.29 sK88 = sK90). % 0.12/0.29 cnf(c1, plain, % 0.12/0.29 sK88 = sK90, % 0.12/0.29 inference(start, [], [c0])). % 0.12/0.29 % 0.12/0.29 cnf(c2, axiom, % 0.12/0.29 totalorderedP(sK90)). % 0.12/0.29 cnf(a0, assumption, % 0.12/0.29 sK90 = sK90). % 0.12/0.29 cnf(a1, assumption, % 0.12/0.29 sK88 = X0). % 0.12/0.29 cnf(c3, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.29 cnf(c4, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.29 cnf(c5, plain, % 0.12/0.29 totalorderedP(X0), % 0.12/0.29 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.29 % 0.12/0.29 cnf(c6, axiom, % 0.12/0.29 ~totalorderedP(sK88)). % 0.12/0.29 cnf(a2, assumption, % 0.12/0.29 X0 = sK88). % 0.12/0.29 cnf(c7, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])). % 0.12/0.29 cnf(c8, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])). % 0.12/0.29 % 0.12/0.29 cnf(c9, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(constraint_solving, [ % 0.12/0.29 bind(X0, sK88) % 0.12/0.29 ], % 0.12/0.29 [a0, a1, a2])). % 0.12/0.29 % 0.12/0.29 % SZS output end IncompleteProof %------------------------------------------------------------------------------