%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : CSR105+7 : TPTP v8.1.0. Bugfixed v7.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 : Fri Jul 15 20:37:15 EDT 2022 % Result : Theorem 3.13s 2.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : CSR105+7 : TPTP v8.1.0. Bugfixed v7.3.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n021.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Thu Jun 9 17:07:53 EDT 2022 % 0.13/0.33 % CPUTime : % 3.13/2.42 % SZS status Theorem % 3.13/2.42 % SZS output begin IncompleteProof % 3.13/2.42 cnf(c0, axiom, % 3.13/2.42 ~s__overlapsTemporally(X0,X1)). % 3.13/2.42 cnf(c1, plain, % 3.13/2.42 ~s__overlapsTemporally(X0,X1), % 3.13/2.42 inference(start, [], [c0])). % 3.13/2.42 % 3.13/2.42 cnf(c2, axiom, % 3.13/2.42 s__overlapsTemporally(X2,X2) | ~s__instance(X2,s__TimeInterval)). % 3.13/2.42 cnf(a0, assumption, % 3.13/2.42 X0 = X2). % 3.13/2.42 cnf(a1, assumption, % 3.13/2.42 X1 = X2). % 3.13/2.42 cnf(c3, plain, % 3.13/2.42 $false, % 3.13/2.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.13/2.42 cnf(c4, plain, % 3.13/2.42 ~s__instance(X2,s__TimeInterval), % 3.13/2.42 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 3.13/2.42 % 3.13/2.42 cnf(c5, axiom, % 3.13/2.42 s__instance(s__BeforeCommonEra,s__TimeInterval)). % 3.13/2.42 cnf(a2, assumption, % 3.13/2.42 X2 = s__BeforeCommonEra). % 3.13/2.42 cnf(a3, assumption, % 3.13/2.42 s__TimeInterval = s__TimeInterval). % 3.13/2.42 cnf(c6, plain, % 3.13/2.42 $false, % 3.13/2.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 3.13/2.42 cnf(c7, plain, % 3.13/2.42 $false, % 3.13/2.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 3.13/2.42 % 3.13/2.42 cnf(c8, plain, % 3.13/2.42 $false, % 3.13/2.42 inference(constraint_solving, [ % 3.13/2.42 bind(X0, s__BeforeCommonEra), % 3.13/2.42 bind(X1, s__BeforeCommonEra), % 3.13/2.43 bind(X2, s__BeforeCommonEra) % 3.13/2.43 ], % 3.13/2.43 [a0, a1, a2, a3])). % 3.13/2.43 % 3.13/2.43 % SZS output end IncompleteProof %------------------------------------------------------------------------------