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