%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWV254-1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n029.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:02 EDT 2022 % Result : Unsatisfiable 4.61s 1.05s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SWV254-1 : TPTP v8.1.0. Released v3.2.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n029.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 : Thu Jun 16 06:54:27 EDT 2022 % 0.12/0.33 % CPUTime : % 4.61/1.05 % SZS status Unsatisfiable % 4.61/1.05 % SZS output begin IncompleteProof % 4.61/1.05 cnf(c0, axiom, % 4.61/1.05 c_lessequals(X0,v_nat,tc_nat)). % 4.61/1.05 cnf(c1, plain, % 4.61/1.05 c_lessequals(X0,v_nat,tc_nat), % 4.61/1.05 inference(start, [], [c0])). % 4.61/1.05 % 4.61/1.05 cnf(c2, axiom, % 4.61/1.05 c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2 | ~c_lessequals(X1,X2,tc_nat)). % 4.61/1.05 cnf(a0, assumption, % 4.61/1.05 X0 = X1). % 4.61/1.05 cnf(a1, assumption, % 4.61/1.05 v_nat = X2). % 4.61/1.05 cnf(a2, assumption, % 4.61/1.05 tc_nat = tc_nat). % 4.61/1.05 cnf(c3, plain, % 4.61/1.05 $false, % 4.61/1.05 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 4.61/1.05 cnf(c4, plain, % 4.61/1.05 c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2, % 4.61/1.05 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 4.61/1.05 % 4.61/1.05 cnf(c5, axiom, % 4.61/1.05 ~c_less(c_plus(X3,X4,tc_nat),X3,tc_nat)). % 4.61/1.05 cnf(a3, assumption, % 4.61/1.05 c_plus(X3,X4,tc_nat) = c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat)). % 4.61/1.05 cnf(c6, plain, % 4.61/1.05 $false, % 4.61/1.05 inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])). % 4.61/1.05 cnf(c7, plain, % 4.61/1.05 $false, % 4.61/1.05 inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])). % 4.61/1.05 cnf(c8, plain, % 4.61/1.05 ~c_less(X2,X3,tc_nat), % 4.61/1.05 inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])). % 4.61/1.05 % 4.61/1.05 cnf(c9, axiom, % 4.61/1.05 c_less(X5,c_Finite__Set_Ocard(c_SetInterval_OatMost(X5,tc_nat),tc_nat),tc_nat)). % 4.61/1.05 cnf(a4, assumption, % 4.61/1.05 X2 = X5). % 4.61/1.05 cnf(a5, assumption, % 4.61/1.05 X3 = c_Finite__Set_Ocard(c_SetInterval_OatMost(X5,tc_nat),tc_nat)). % 4.61/1.05 cnf(a6, assumption, % 4.61/1.05 tc_nat = tc_nat). % 4.61/1.05 cnf(c10, plain, % 4.61/1.05 $false, % 4.61/1.05 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])). % 4.61/1.05 cnf(c11, plain, % 4.61/1.05 $false, % 4.61/1.05 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])). % 4.61/1.05 % 4.61/1.05 cnf(c12, plain, % 4.61/1.05 $false, % 4.61/1.05 inference(constraint_solving, [ % 4.61/1.05 bind(X0, c_Finite__Set_Ocard(c_SetInterval_OatMost(X5,tc_nat),tc_nat)), % 4.61/1.05 bind(X1, c_Finite__Set_Ocard(c_SetInterval_OatMost(X5,tc_nat),tc_nat)), % 4.61/1.05 bind(X2, v_nat), % 4.61/1.05 bind(X3, c_Finite__Set_Ocard(c_SetInterval_OatMost(X5,tc_nat),tc_nat)), % 4.61/1.05 bind(X4, c_minus(X2,X1,tc_nat)), % 4.61/1.05 bind(X5, v_nat) % 4.61/1.05 ], % 4.61/1.05 [a0, a1, a2, a3, a4, a5, a6])). % 4.61/1.05 % 4.61/1.05 % SZS output end IncompleteProof %------------------------------------------------------------------------------