%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : PUZ133_2 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n024.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 : Mon Jul 18 18:27:45 EDT 2022 % Result : Theorem 0.76s 1.05s % Output : Refutation 0.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : PUZ133_2 : TPTP v8.1.0. Released v5.0.0. % 0.12/0.12 % Command : spasst-tptp-script %s %d % 0.13/0.33 % Computer : n024.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 : 600 % 0.13/0.33 % DateTime : Sat May 28 19:55:37 EDT 2022 % 0.13/0.33 % CPUTime : % 0.18/0.47 % Using integer theory % 0.76/1.05 % 0.76/1.05 % 0.76/1.05 % SZS status Theorem for /tmp/SPASST_25695_n024.cluster.edu % 0.76/1.05 % 0.76/1.05 SPASS V 2.2.22 in combination with yices. % 0.76/1.05 SPASS beiseite: Proof found by SPASS and SMT. % 0.76/1.05 Problem: /tmp/SPASST_25695_n024.cluster.edu % 0.76/1.05 SPASS derived 104 clauses, backtracked 43 clauses and kept 146 clauses. % 0.76/1.05 SPASS backtracked 4 times (1 times due to theory inconsistency). % 0.76/1.05 SPASS allocated 6386 KBytes. % 0.76/1.05 SPASS spent 0:00:00.03 on the problem. % 0.76/1.05 0:00:00.00 for the input. % 0.76/1.05 0:00:00.01 for the FLOTTER CNF translation. % 0.76/1.05 0:00:00.00 for inferences. % 0.76/1.05 0:00:00.00 for the backtracking. % 0.76/1.05 0:00:00.01 for the reduction. % 0.76/1.05 0:00:00.00 for interacting with the SMT procedure. % 0.76/1.05 % 0.76/1.05 % 0.76/1.05 % SZS output start CNFRefutation for /tmp/SPASST_25695_n024.cluster.edu % 0.76/1.05 % 0.76/1.05 % Here is a proof with depth 0, length 16 : % 0.76/1.05 5[0:Inp] || -> queens_p*. % 0.76/1.05 6[0:Inp] || queens_q* -> . % 0.76/1.05 7[0:Inp] || -> lesseq(1,skc3)*. % 0.76/1.05 8[0:Inp] || -> lesseq(skc2,n)*. % 0.76/1.05 9[0:Inp] || -> queens_q lesseq(skc3,n)*. % 0.76/1.05 10[0:Inp] || -> queens_q lesseq(plus(1,skc3),skc2)*. % 0.76/1.05 11(e)[0:Inp] || -> equal(p(perm(U)),q(U))**. % 0.76/1.05 12[0:Inp] || -> equal(minus(plus(1,n),U),perm(U))**. % 0.76/1.05 13[0:Inp] || -> equal(minus(perm(U),perm(V)),minus(V,U))**. % 0.76/1.05 14[0:Inp] || lesseq(U,n) lesseq(1,U) -> lesseq(perm(U),n)*. % 0.76/1.05 16[0:Inp] || lesseq(plus(1,skc3),skc2) -> queens_q lesseq(plus(1,perm(skc2)),perm(skc3))*. % 0.76/1.05 17[0:Inp] || -> queens_q equal(minus(q(skc3),skc3),minus(q(skc2),skc2))** equal(plus(q(skc3),skc3),plus(q(skc2),skc2)) equal(q(skc3),q(skc2)). % 0.76/1.05 18[0:Inp] || lesseq(U,n)* equal(p(V),p(U)) lesseq(plus(1,V),U)* lesseq(V,n)* lesseq(1,V) queens_p -> . % 0.76/1.05 19[0:Inp] || lesseq(U,n)* equal(plus(p(V),V),plus(p(U),U))* lesseq(plus(1,V),U)* lesseq(V,n)* lesseq(1,V) queens_p -> . % 0.76/1.05 20[0:Inp] || lesseq(U,n)* equal(minus(p(V),V),minus(p(U),U))* lesseq(plus(1,V),U)* lesseq(V,n)* lesseq(1,V) queens_p -> . % 0.76/1.05 229(e)[0:ThR:20,19,18,17,16,14,13,12,11,10,9,8,7,6,5] || -> . % 0.76/1.05 % 0.76/1.05 % SZS output end CNFRefutation for /tmp/SPASST_25695_n024.cluster.edu % 0.76/1.05 % 0.76/1.05 Formulae used in the proof : fof_q_type fof_queens_sym fof_queens_q fof_permutation fof_permutation_another_one fof_permutation_range fof_queens_p % 0.76/1.05 % 0.76/1.06 SPASS+T ended %------------------------------------------------------------------------------