%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN331+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 : n017.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:09:45 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : SYN331+1 : TPTP v8.1.0. Released v2.0.0. % 0.08/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n017.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 19:19:34 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.35 % SZS status Theorem % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 ~big_f(sK0(X0,X1),X0)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 ~big_f(sK0(X0,X1),X0), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 big_f(X2,X3) | ~big_f(sK0(X2,X3),sK0(X2,X3))). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 sK0(X0,X1) = X2). % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 X0 = X3). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 ~big_f(sK0(X2,X3),sK0(X2,X3)), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(c5, axiom, % 0.12/0.35 big_f(sK0(X4,X5),sK0(X4,X5)) | big_f(X5,X4)). % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 sK0(X2,X3) = X5). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 sK0(X2,X3) = X4). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 big_f(sK0(X4,X5),sK0(X4,X5)), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.35 % 0.12/0.35 cnf(c8, axiom, % 0.12/0.35 big_f(X6,X7) | ~big_f(sK0(X6,X7),sK0(X6,X7))). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 sK0(X4,X5) = sK0(X6,X7)). % 0.12/0.35 cnf(a5, assumption, % 0.12/0.35 sK0(X4,X5) = sK0(X6,X7)). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.35 cnf(c10, plain, % 0.12/0.35 big_f(X6,X7), % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.12/0.35 % 0.12/0.35 cnf(c11, plain, % 0.12/0.35 ~big_f(sK0(X2,X3),sK0(X2,X3))). % 0.12/0.35 cnf(a6, assumption, % 0.12/0.35 X6 = sK0(X2,X3)). % 0.12/0.35 cnf(a7, assumption, % 0.12/0.35 X7 = sK0(X2,X3)). % 0.12/0.35 cnf(c12, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.35 % 0.12/0.35 cnf(c13, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, X3), % 0.12/0.35 bind(X1, X1), % 0.12/0.35 bind(X2, sK0(X0,X1)), % 0.12/0.35 bind(X3, X3), % 0.12/0.35 bind(X4, sK0(X2,X3)), % 0.12/0.35 bind(X5, sK0(X2,X3)), % 0.12/0.35 bind(X6, sK0(X2,X3)), % 0.12/0.35 bind(X7, sK0(X2,X3)) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------