%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n028.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 : Wed Jul 20 19:46:49 EDT 2022 % Result : Theorem 0.15s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SWV413+1 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.36 % Computer : n028.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Thu Jun 16 01:24:26 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.37 % SZS status Theorem % 0.15/0.37 % SZS output begin IncompleteProof % 0.15/0.37 cnf(c0, axiom, % 0.15/0.37 less_than(sK4,sK3)). % 0.15/0.37 cnf(c1, plain, % 0.15/0.37 less_than(sK4,sK3), % 0.15/0.37 inference(start, [], [c0])). % 0.15/0.37 % 0.15/0.37 cnf(c2, axiom, % 0.15/0.37 ~less_than(sK4,X0) | ~pair_in_list(update_slb(sK1,sK4),sK2,X0)). % 0.15/0.37 cnf(a0, assumption, % 0.15/0.37 sK4 = sK4). % 0.15/0.37 cnf(a1, assumption, % 0.15/0.37 sK3 = X0). % 0.15/0.37 cnf(c3, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.37 cnf(c4, plain, % 0.15/0.37 ~pair_in_list(update_slb(sK1,sK4),sK2,X0), % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.15/0.37 % 0.15/0.37 cnf(c5, axiom, % 0.15/0.37 pair_in_list(update_slb(X1,X2),X3,X4) | ~less_than(X2,X4) | ~pair_in_list(X1,X3,X4)). % 0.15/0.37 cnf(a2, assumption, % 0.15/0.37 update_slb(sK1,sK4) = update_slb(X1,X2)). % 0.15/0.37 cnf(a3, assumption, % 0.15/0.37 sK2 = X3). % 0.15/0.37 cnf(a4, assumption, % 0.15/0.37 X0 = X4). % 0.15/0.37 cnf(c6, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.15/0.37 cnf(c7, plain, % 0.15/0.37 ~less_than(X2,X4) | ~pair_in_list(X1,X3,X4), % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])). % 0.15/0.37 % 0.15/0.37 cnf(c8, plain, % 0.15/0.37 less_than(sK4,sK3)). % 0.15/0.37 cnf(a5, assumption, % 0.15/0.37 X2 = sK4). % 0.15/0.37 cnf(a6, assumption, % 0.15/0.37 X4 = sK3). % 0.15/0.37 cnf(c9, plain, % 0.15/0.37 ~pair_in_list(X1,X3,X4), % 0.15/0.37 inference(predicate_reduction, [assumptions([a5, a6])], [c7, c8])). % 0.15/0.37 % 0.15/0.37 cnf(c10, axiom, % 0.15/0.37 pair_in_list(sK1,sK2,sK3)). % 0.15/0.37 cnf(a7, assumption, % 0.15/0.37 X1 = sK1). % 0.15/0.37 cnf(a8, assumption, % 0.15/0.37 X3 = sK2). % 0.15/0.37 cnf(a9, assumption, % 0.15/0.37 X4 = sK3). % 0.15/0.37 cnf(c11, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c10])). % 0.15/0.37 cnf(c12, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a7, a8, a9])], [c9, c10])). % 0.15/0.37 % 0.15/0.37 cnf(c13, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(constraint_solving, [ % 0.15/0.37 bind(X0, sK3), % 0.15/0.37 bind(X1, sK1), % 0.15/0.37 bind(X2, sK4), % 0.15/0.37 bind(X3, sK2), % 0.15/0.37 bind(X4, sK3) % 0.15/0.37 ], % 0.15/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.15/0.37 % 0.15/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------