%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n006.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 : 300s % DateTime : Sun Apr 6 10:09:27 AM UTC 2025 % Result : Theorem 0.83s 1.14s % Output : Refutation 0.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % 0.06/0.12 % Command : spasst-tptp-script %s %d % 0.13/0.33 % Computer : n006.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Sun Apr 6 03:15:08 EDT 2025 % 0.13/0.34 % CPUTime : % 0.19/0.47 % Using integer theory % 0.83/1.14 % 0.83/1.14 % 0.83/1.14 % SZS status Theorem for /tmp/SPASST_4155_n006.cluster.edu % 0.83/1.14 % 0.83/1.14 SPASS V 2.2.22 in combination with yices. % 0.83/1.14 SPASS beiseite: Proof found by SMT. % 0.83/1.14 Problem: /tmp/SPASST_4155_n006.cluster.edu % 0.83/1.14 SPASS derived 494 clauses, backtracked 0 clauses and kept 305 clauses. % 0.83/1.14 SPASS backtracked 1 times (1 times due to theory inconsistency). % 0.83/1.14 SPASS allocated 6668 KBytes. % 0.83/1.14 SPASS spent 0:00:00.06 on the problem. % 0.83/1.14 0:00:00.00 for the input. % 0.83/1.14 0:00:00.01 for the FLOTTER CNF translation. % 0.83/1.14 0:00:00.00 for inferences. % 0.83/1.14 0:00:00.00 for the backtracking. % 0.83/1.14 0:00:00.03 for the reduction. % 0.83/1.14 0:00:00.01 for interacting with the SMT procedure. % 0.83/1.14 % 0.83/1.14 % 0.83/1.14 % SZS output start CNFRefutation for /tmp/SPASST_4155_n006.cluster.edu % 0.83/1.14 % 0.83/1.14 % Here is a proof with depth 0, length 36 : % 0.83/1.14 1[0:Inp] || -> general(c__supremum__)*. % 0.83/1.14 2[0:Inp] || -> general(c__infimum__)*. % 0.83/1.14 3[0:Inp] || -> symbol(skc7)*. % 0.83/1.14 5[0:Inp] || -> general(skc5)*. % 0.83/1.14 6[0:Inp] || -> general(skc4)*. % 0.83/1.14 7[0:Inp] || -> symbol(skf3(U))*. % 0.83/1.14 8[0:Inp] || -> general(f__integer__(U))*. % 0.83/1.14 9[0:Inp] || -> p__less__(c__infimum__,f__integer__(U))*. % 0.83/1.14 11[0:Inp] || symbol(U) -> general(f__symbolic__(U))*. % 0.83/1.14 12[0:Inp] || hp(U) -> SkP0(V,U)*. % 0.83/1.14 15[0:Inp] || -> equal(U,V) SkP0(V,U)*. % 0.83/1.14 16[0:Inp] || symbol(U) -> p__less__(f__symbolic__(U),c__supremum__)*. % 0.83/1.14 17[0:Inp] || tp(skc5) SkP0(skc4,skc5)* -> . % 0.83/1.14 20[0:Inp] || SkP0(skc4,skc5)* -> equal(skc5,skc4). % 0.83/1.14 21[0:Inp] || -> SkP0(U,V)* p__less__(U,f__integer__(5))*. % 0.83/1.14 22[0:Inp] || -> SkP0(U,V)* p__greater__(U,f__integer__(3))*. % 0.83/1.14 24[0:Inp] || symbol(U) -> p__less__(f__integer__(V),f__symbolic__(U))*. % 0.83/1.14 25[0:Inp] || SkP0(skc4,skc5) -> p__less__(skc4,f__integer__(5))*. % 0.83/1.14 26[0:Inp] || SkP0(skc4,skc5) -> p__greater__(skc4,f__integer__(3))*. % 0.83/1.14 28[0:Inp] || lesseq(U,V) -> p__less_equal__(f__integer__(U),f__integer__(V))*. % 0.83/1.14 29[0:Inp] || equal(f__integer__(U),f__integer__(V))* -> equal(U,V). % 0.83/1.14 30[0:Inp] || equal(U,V) -> equal(f__integer__(U),f__integer__(V))*. % 0.83/1.14 31[0:Inp] || general(U) equal(U,f__integer__(4))*+ -> tp(U)*. % 0.83/1.14 32[0:Inp] || general(U) equal(U,f__integer__(4))*+ -> hp(U)*. % 0.83/1.14 33[0:Inp] || general(U) equal(U,f__integer__(V))*+ -> p__is_integer__(U)*. % 0.83/1.14 34[0:Inp] || general(U) p__is_symbolic__(U) -> equal(f__symbolic__(skf3(U)),U)**. % 0.83/1.14 35[0:Inp] || general(U) p__is_integer__(U) -> equal(f__integer__(skf2(U)),U)**. % 0.83/1.14 36[0:Inp] || general(U)+ general(V) -> p__less_equal__(U,V)* p__less_equal__(V,U)*. % 0.83/1.14 37(e)[0:Inp] || general(U) general(V) p__greater__(U,V) -> p__less_equal__(V,U)*. % 0.83/1.14 40(e)[0:Inp] || general(U) general(V) p__less__(U,V) -> p__less_equal__(U,V)*. % 0.83/1.14 41[0:Inp] || general(U) -> p__is_integer__(U) p__is_symbolic__(U)* equal(U,c__infimum__) equal(U,c__supremum__). % 0.83/1.14 43(e)[0:Inp] || general(U) general(V) p__greater__(U,V)* equal(U,V) -> . % 0.83/1.14 44(e)[0:Inp] || general(U) general(V) p__less__(U,V)* equal(U,V) -> . % 0.83/1.14 49(e)[0:Inp] || general(U) general(V) p__less_equal__(U,V)* p__less_equal__(V,U)* -> equal(U,V). % 0.83/1.14 50(e)[0:Inp] || general(U) general(V) general(W) p__less_equal__(U,V)* p__less_equal__(V,W)* -> p__less_equal__(U,W)*. % 0.83/1.14 764(e)[0:ThR:50,49,44,43,41,40,37,36,35,34,33,32,31,30,29,28,26,25,24,22,21,20,17,16,15,12,11,9,8,7,6,5,3,2,1] || -> . % 0.83/1.14 % 0.83/1.14 % SZS output end CNFRefutation for /tmp/SPASST_4155_n006.cluster.edu % 0.83/1.14 % 0.83/1.14 Formulae used in the proof : fof_sup_type fof_inf_type fof_general_type fof_formula_2_left_0 fof_p__is_symbolic__def_ax fof_symbol_type fof_f__integer___decl fof_f__symbolic___decl fof_maximal_element_ax fof_formula_0_transition_axiom_0 fof_numerals_less_than_symbols_ax fof_numeral_ordering_ax fof_f__integer__def_ax fof_formula_1_right_0 fof_p__is_integer__def_ax fof_strongly_connected_ordering_ax fof_p__greater_equal__def_ax fof_p__less__def_ax fof_p__greater__def_ax fof_antisymmetric_ordering_ax % 0.83/1.14 % 0.83/1.14 SPASS+T ended %------------------------------------------------------------------------------