%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT002_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n013.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 : Sat Jul 16 01:31:42 EDT 2022 % Result : Theorem 0.43s 1.01s % Output : Refutation 0.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : DAT002_1 : TPTP v8.1.0. Released v5.0.0. % 0.04/0.12 % Command : spasst-tptp-script %s %d % 0.12/0.33 % Computer : n013.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 : Fri Jul 1 17:10:44 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.46 % Using integer theory % 0.43/1.01 % 0.43/1.01 % 0.43/1.01 % SZS status Theorem for /tmp/SPASST_8713_n013.cluster.edu % 0.43/1.01 % 0.43/1.01 SPASS V 2.2.22 in combination with yices. % 0.43/1.01 SPASS beiseite: Proof found by SPASS. % 0.43/1.01 Problem: /tmp/SPASST_8713_n013.cluster.edu % 0.43/1.01 SPASS derived 6 clauses, backtracked 0 clauses and kept 44 clauses. % 0.43/1.01 SPASS backtracked 0 times (0 times due to theory inconsistency). % 0.43/1.01 SPASS allocated 6240 KBytes. % 0.43/1.01 SPASS spent 0:00:00.01 on the problem. % 0.43/1.01 0:00:00.00 for the input. % 0.43/1.01 0:00:00.00 for the FLOTTER CNF translation. % 0.43/1.01 0:00:00.00 for inferences. % 0.43/1.01 0:00:00.00 for the backtracking. % 0.43/1.01 0:00:00.00 for the reduction. % 0.43/1.01 0:00:00.00 for interacting with the SMT procedure. % 0.43/1.01 % 0.43/1.01 % 0.43/1.01 % SZS output start CNFRefutation for /tmp/SPASST_8713_n013.cluster.edu % 0.43/1.01 % 0.43/1.01 % Here is a proof with depth 5, length 20 : % 0.43/1.01 2[0:Inp] || -> list(nil)*. % 0.43/1.01 5[0:Inp] || list(U) -> list(mycons(V,U))*. % 0.43/1.01 6[0:Inp] || less(U,V) -> fib_sorted(mycons(U,mycons(V,nil)))*. % 0.43/1.01 7[0:Inp] || fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil))))))* -> . % 0.43/1.01 8[0:Inp] || list(U) fib_sorted(mycons(V,mycons(W,U))) greatereq(W,plus(X,V)) less(X,V) -> fib_sorted(mycons(X,mycons(V,mycons(W,U))))*. % 0.43/1.01 40[0:TOC:6.0] || -> fib_sorted(mycons(U,mycons(V,nil)))* lesseq(V,U). % 0.43/1.01 41[0:ArS:8.2] || list(U) fib_sorted(mycons(V,mycons(W,U))) lesseq(plus(X,V),W) less(X,V) -> fib_sorted(mycons(X,mycons(V,mycons(W,U))))*. % 0.43/1.01 42[0:TOC:41.3] || list(U) fib_sorted(mycons(V,mycons(W,U))) -> fib_sorted(mycons(X,mycons(V,mycons(W,U))))* lesseq(V,X) less(W,plus(X,V)). % 0.43/1.01 43[0:Res:42.4,7.0] || list(mycons(7,mycons(100,nil))) fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))* -> lesseq(2,1) less(4,plus(1,2)). % 0.43/1.01 44[0:ArS:43.3] || list(mycons(7,mycons(100,nil))) fib_sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))* -> . % 0.43/1.01 46[0:Res:42.2,44.1] || list(mycons(100,nil)) fib_sorted(mycons(4,mycons(7,mycons(100,nil))))* list(mycons(7,mycons(100,nil))) -> lesseq(4,2) less(7,plus(2,4)). % 0.43/1.01 48[0:ArS:46.4] || list(mycons(100,nil)) fib_sorted(mycons(4,mycons(7,mycons(100,nil))))* list(mycons(7,mycons(100,nil))) -> . % 0.43/1.01 49[0:MRR:48.2,5.1] || list(mycons(100,nil)) fib_sorted(mycons(4,mycons(7,mycons(100,nil))))* -> . % 0.43/1.01 50[0:Res:42.2,49.1] || list(nil) fib_sorted(mycons(7,mycons(100,nil)))* list(mycons(100,nil)) -> lesseq(7,4) less(100,plus(4,7)). % 0.43/1.01 51[0:ArS:50.4] || list(nil) fib_sorted(mycons(7,mycons(100,nil)))* list(mycons(100,nil)) -> . % 0.43/1.01 52[0:MRR:51.0,2.0] || fib_sorted(mycons(7,mycons(100,nil)))* list(mycons(100,nil)) -> . % 0.43/1.01 53[0:Res:40.0,52.0] || list(mycons(100,nil))* -> lesseq(100,7). % 0.43/1.01 54[0:ArS:53.1] || list(mycons(100,nil))* -> . % 0.43/1.01 55[0:Res:5.1,54.0] || list(nil)* -> . % 0.43/1.01 56(e)[0:MRR:55.0,2.0] || -> . % 0.43/1.01 % 0.43/1.01 % SZS output end CNFRefutation for /tmp/SPASST_8713_n013.cluster.edu % 0.43/1.01 % 0.43/1.01 Formulae used in the proof : fof_empty_fib_sorted fof_single_is_fib_sorted fof_mycons_type fof_double_is_fib_sorted_if_ordered fof_check_list % 0.74/1.03 % 0.74/1.03 SPASS+T ended %------------------------------------------------------------------------------