%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN358+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 : n007.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:10:03 EDT 2022 % Result : Theorem 0.13s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SYN358+1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n007.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 : Tue Jul 12 00:02:33 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 ~big_q(X0) | ~p | ~big_q(X1)). % 0.13/0.36 cnf(c1, plain, % 0.13/0.36 ~big_q(X0) | ~p | ~big_q(X1), % 0.13/0.36 inference(start, [], [c0])). % 0.13/0.36 % 0.13/0.36 cnf(c2, axiom, % 0.13/0.36 big_q(sK0) | big_q(sK1)). % 0.13/0.36 cnf(a0, assumption, % 0.13/0.36 X0 = sK1). % 0.13/0.36 cnf(c3, plain, % 0.13/0.36 ~p | ~big_q(X1), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 cnf(c4, plain, % 0.13/0.36 big_q(sK0), % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.13/0.36 % 0.13/0.36 cnf(c5, axiom, % 0.13/0.36 ~big_q(X2) | ~p | ~big_q(X3)). % 0.13/0.36 cnf(a1, assumption, % 0.13/0.36 sK0 = X3). % 0.13/0.36 cnf(c6, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.36 cnf(c7, plain, % 0.13/0.36 ~big_q(X2) | ~p, % 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.13/0.36 % 0.13/0.36 cnf(c8, plain, % 0.13/0.36 big_q(sK0)). % 0.13/0.36 cnf(a2, assumption, % 0.13/0.36 X2 = sK0). % 0.13/0.36 cnf(c9, plain, % 0.13/0.36 ~p, % 0.13/0.36 inference(predicate_reduction, [assumptions([a2])], [c7, c8])). % 0.13/0.36 % 0.13/0.36 cnf(c10, axiom, % 0.13/0.36 p). % 0.13/0.36 cnf(c11, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [], [c9, c10])). % 0.13/0.36 cnf(c12, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(strict_predicate_extension, [], [c9, c10])). % 0.13/0.36 % 0.13/0.36 cnf(c13, plain, % 0.13/0.36 p). % 0.13/0.36 cnf(c14, plain, % 0.13/0.36 ~big_q(X1), % 0.13/0.36 inference(predicate_reduction, [], [c3, c13])). % 0.13/0.36 % 0.13/0.36 cnf(c15, plain, % 0.13/0.36 big_q(X0)). % 0.13/0.36 cnf(a3, assumption, % 0.13/0.36 X1 = X0). % 0.13/0.36 cnf(c16, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(predicate_reduction, [assumptions([a3])], [c14, c15])). % 0.13/0.36 % 0.13/0.36 cnf(c17, plain, % 0.13/0.36 $false, % 0.13/0.36 inference(constraint_solving, [ % 0.13/0.36 bind(X0, sK1), % 0.13/0.36 bind(X1, sK1), % 0.13/0.36 bind(X2, sK0), % 0.13/0.36 bind(X3, sK0) % 0.13/0.36 ], % 0.13/0.36 [a0, a1, a2, a3])). % 0.13/0.36 % 0.13/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------