%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN722+1 : TPTP v8.1.0. Released v2.5.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 : Thu Jul 21 08:13:01 EDT 2022 % Result : Theorem 0.19s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN722+1 : TPTP v8.1.0. Released v2.5.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n027.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 14:37:34 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.34 % SZS status Theorem % 0.19/0.34 % SZS output begin IncompleteProof % 0.19/0.34 cnf(c0, axiom, % 0.19/0.34 ~p(b) | ~p(a)). % 0.19/0.34 cnf(c1, plain, % 0.19/0.34 ~p(b) | ~p(a), % 0.19/0.34 inference(start, [], [c0])). % 0.19/0.34 % 0.19/0.34 cnf(c2, axiom, % 0.19/0.34 ~q(d) | ~q(c) | ~q(sK0(X0)) | ~q(X0) | p(X0)). % 0.19/0.34 cnf(a0, assumption, % 0.19/0.34 b = X0). % 0.19/0.34 cnf(c3, plain, % 0.19/0.34 ~p(a), % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.34 cnf(c4, plain, % 0.19/0.34 ~q(d) | ~q(c) | ~q(sK0(X0)) | ~q(X0), % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.34 % 0.19/0.34 cnf(c5, axiom, % 0.19/0.34 q(X1)). % 0.19/0.34 cnf(a1, assumption, % 0.19/0.34 d = X1). % 0.19/0.34 cnf(c6, plain, % 0.19/0.34 ~q(c) | ~q(sK0(X0)) | ~q(X0), % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.19/0.34 cnf(c7, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.19/0.34 % 0.19/0.34 cnf(c8, axiom, % 0.19/0.34 q(X2)). % 0.19/0.34 cnf(a2, assumption, % 0.19/0.34 c = X2). % 0.19/0.34 cnf(c9, plain, % 0.19/0.34 ~q(sK0(X0)) | ~q(X0), % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.19/0.34 cnf(c10, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.19/0.34 % 0.19/0.34 cnf(c11, axiom, % 0.19/0.34 q(X3)). % 0.19/0.34 cnf(a3, assumption, % 0.19/0.34 sK0(X0) = X3). % 0.19/0.34 cnf(c12, plain, % 0.19/0.34 ~q(X0), % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.19/0.34 cnf(c13, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])). % 0.19/0.34 % 0.19/0.34 cnf(c14, axiom, % 0.19/0.34 q(X4)). % 0.19/0.34 cnf(a4, assumption, % 0.19/0.34 X0 = X4). % 0.19/0.34 cnf(c15, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.19/0.34 cnf(c16, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])). % 0.19/0.34 % 0.19/0.34 cnf(c17, axiom, % 0.19/0.34 ~q(d) | ~q(c) | ~q(sK0(X5)) | ~q(X5) | p(X5)). % 0.19/0.34 cnf(a5, assumption, % 0.19/0.34 a = X5). % 0.19/0.34 cnf(c18, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c3, c17])). % 0.19/0.34 cnf(c19, plain, % 0.19/0.34 ~q(d) | ~q(c) | ~q(sK0(X5)) | ~q(X5), % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a5])], [c3, c17])). % 0.19/0.34 % 0.19/0.34 cnf(c20, plain, % 0.19/0.34 q(d)). % 0.19/0.34 cnf(a6, assumption, % 0.19/0.34 d = d). % 0.19/0.34 cnf(c21, plain, % 0.19/0.34 ~q(c) | ~q(sK0(X5)) | ~q(X5), % 0.19/0.34 inference(predicate_reduction, [assumptions([a6])], [c19, c20])). % 0.19/0.34 % 0.19/0.34 cnf(c22, plain, % 0.19/0.34 q(c)). % 0.19/0.34 cnf(a7, assumption, % 0.19/0.34 c = c). % 0.19/0.34 cnf(c23, plain, % 0.19/0.34 ~q(sK0(X5)) | ~q(X5), % 0.19/0.34 inference(predicate_reduction, [assumptions([a7])], [c21, c22])). % 0.19/0.34 % 0.19/0.34 cnf(c24, axiom, % 0.19/0.34 q(X6)). % 0.19/0.34 cnf(a8, assumption, % 0.19/0.34 sK0(X5) = X6). % 0.19/0.34 cnf(c25, plain, % 0.19/0.34 ~q(X5), % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c23, c24])). % 0.19/0.34 cnf(c26, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a8])], [c23, c24])). % 0.19/0.34 % 0.19/0.34 cnf(c27, axiom, % 0.19/0.34 q(X7)). % 0.19/0.34 cnf(a9, assumption, % 0.19/0.34 X5 = X7). % 0.19/0.34 cnf(c28, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c25, c27])). % 0.19/0.34 cnf(c29, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c25, c27])). % 0.19/0.34 % 0.19/0.34 cnf(c30, plain, % 0.19/0.34 $false, % 0.19/0.34 inference(constraint_solving, [ % 0.19/0.34 bind(X0, b), % 0.19/0.34 bind(X1, d), % 0.19/0.34 bind(X2, c), % 0.19/0.34 bind(X3, sK0(X0)), % 0.19/0.34 bind(X4, b), % 0.19/0.34 bind(X5, a), % 0.19/0.34 bind(X6, sK0(X5)), % 0.19/0.34 bind(X7, a) % 0.19/0.34 ], % 0.19/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.19/0.34 % 0.19/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------