%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN061+1 : TPTP v8.1.0. Released v2.0.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 21 08:07:44 EDT 2022 % Result : Theorem 0.16s 0.32s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SYN061+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.11/0.31 % Computer : n018.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 600 % 0.11/0.31 % DateTime : Mon Jul 11 19:14:29 EDT 2022 % 0.16/0.31 % CPUTime : % 0.16/0.32 % SZS status Theorem % 0.16/0.32 % SZS output begin IncompleteProof % 0.16/0.32 cnf(c0, axiom, % 0.16/0.32 ~big_j(X0) | ~big_i(X0)). % 0.16/0.32 cnf(c1, plain, % 0.16/0.32 ~big_j(X0) | ~big_i(X0), % 0.16/0.32 inference(start, [], [c0])). % 0.16/0.32 % 0.16/0.32 cnf(c2, axiom, % 0.16/0.32 big_j(X1) | big_h(X1)). % 0.16/0.32 cnf(a0, assumption, % 0.16/0.32 X0 = X1). % 0.16/0.32 cnf(c3, plain, % 0.16/0.32 ~big_i(X0), % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.16/0.32 cnf(c4, plain, % 0.16/0.32 big_h(X1), % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.16/0.32 % 0.16/0.32 cnf(c5, axiom, % 0.16/0.32 ~big_h(X2) | ~big_f(X2)). % 0.16/0.32 cnf(a1, assumption, % 0.16/0.32 X1 = X2). % 0.16/0.32 cnf(c6, plain, % 0.16/0.32 $false, % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.16/0.32 cnf(c7, plain, % 0.16/0.32 ~big_f(X2), % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.16/0.32 % 0.16/0.32 cnf(c8, axiom, % 0.16/0.32 big_f(sK0)). % 0.16/0.32 cnf(a2, assumption, % 0.16/0.32 X2 = sK0). % 0.16/0.32 cnf(c9, plain, % 0.16/0.32 $false, % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.16/0.32 cnf(c10, plain, % 0.16/0.32 $false, % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 0.16/0.32 % 0.16/0.32 cnf(c11, axiom, % 0.16/0.32 big_i(sK0)). % 0.16/0.32 cnf(a3, assumption, % 0.16/0.32 X0 = sK0). % 0.16/0.32 cnf(c12, plain, % 0.16/0.32 $false, % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a3])], [c3, c11])). % 0.16/0.32 cnf(c13, plain, % 0.16/0.32 $false, % 0.16/0.32 inference(strict_predicate_extension, [assumptions([a3])], [c3, c11])). % 0.16/0.32 % 0.16/0.32 cnf(c14, plain, % 0.16/0.32 $false, % 0.16/0.32 inference(constraint_solving, [ % 0.16/0.32 bind(X0, sK0), % 0.16/0.32 bind(X1, sK0), % 0.16/0.32 bind(X2, sK0) % 0.16/0.32 ], % 0.16/0.32 [a0, a1, a2, a3])). % 0.16/0.32 % 0.16/0.32 % SZS output end IncompleteProof %------------------------------------------------------------------------------