%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT074_1 : TPTP v8.1.0. Released v6.1.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n015.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:32:05 EDT 2022 % Result : Theorem 1.13s 1.26s % Output : Refutation 1.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : DAT074_1 : TPTP v8.1.0. Released v6.1.0. % 0.07/0.12 % Command : spasst-tptp-script %s %d % 0.12/0.33 % Computer : n015.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 20:08:43 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.46 % Using integer theory % 1.13/1.26 % 1.13/1.26 % 1.13/1.26 % SZS status Theorem for /tmp/SPASST_31247_n015.cluster.edu % 1.13/1.26 % 1.13/1.26 SPASS V 2.2.22 in combination with yices. % 1.13/1.26 SPASS beiseite: Proof found by SPASS. % 1.13/1.26 Problem: /tmp/SPASST_31247_n015.cluster.edu % 1.13/1.26 SPASS derived 1013 clauses, backtracked 0 clauses and kept 365 clauses. % 1.13/1.26 SPASS backtracked 0 times (0 times due to theory inconsistency). % 1.13/1.26 SPASS allocated 7623 KBytes. % 1.13/1.26 SPASS spent 0:00:00.21 on the problem. % 1.13/1.26 0:00:00.00 for the input. % 1.13/1.26 0:00:00.01 for the FLOTTER CNF translation. % 1.13/1.26 0:00:00.02 for inferences. % 1.13/1.26 0:00:00.00 for the backtracking. % 1.13/1.26 0:00:00.14 for the reduction. % 1.13/1.26 0:00:00.02 for interacting with the SMT procedure. % 1.13/1.26 % 1.13/1.26 % 1.13/1.26 % SZS output start CNFRefutation for /tmp/SPASST_31247_n015.cluster.edu % 1.13/1.26 % 1.13/1.26 % Here is a proof with depth 2, length 15 : % 1.13/1.26 4[0:Inp] || -> array(init(U))*. % 1.13/1.26 5[0:Inp] || -> distinct(init(U),V)*. % 1.13/1.26 12[0:Inp] || -> equal(read(init(U),V),U)**. % 1.13/1.26 35[0:Inp] || array(U) greater(V,W)* greatereq(W,0) equal(read(U,X),read(U,W))* greatereq(X,0) greater(V,X)* distinct(U,V)* -> equal(X,W). % 1.13/1.26 66[0:ThA] || -> equal(ceiling(U),U)**. % 1.13/1.26 90[0:ArS:35.5] || array(U) less(V,W)* lesseq(0,V) equal(read(U,X),read(U,V))* lesseq(0,X) less(X,W)* distinct(U,W)* -> equal(X,V). % 1.13/1.26 91[0:TOC:90.4] || array(U) distinct(U,V)* equal(read(U,W),read(U,X))*+ -> equal(W,X) lesseq(V,X)* lesseq(V,W)* less(X,0) less(W,0). % 1.13/1.26 597[0:SpL:12.0,91.2] || array(init(U)) distinct(init(U),V)* equal(read(init(U),W),U)** -> equal(W,X)* lesseq(V,X)* lesseq(V,W)* less(X,0) less(W,0). % 1.13/1.26 601[0:Rew:12.0,597.2] || array(init(U)) distinct(init(U),V)* equal(U,U) -> equal(W,X)* lesseq(V,X)* lesseq(V,W)* less(X,0) less(W,0). % 1.13/1.26 602[0:Obv:601.2] || array(init(U)) distinct(init(U),V)* -> equal(W,X)* lesseq(V,X)* lesseq(V,W)* less(X,0) less(W,0). % 1.13/1.26 603[0:MRR:602.0,602.1,4.0,5.0] || -> equal(U,V)* lesseq(W,V)* lesseq(W,U)* less(V,0) less(U,0). % 1.13/1.26 1099[0:SpR:603.0,66.0] || -> lesseq(U,V)* lesseq(U,ceiling(W))* less(V,0) less(ceiling(W),0) equal(V,W)*. % 1.13/1.26 1438[0:BLD:1099.0] || -> less(U,0)* less(ceiling(V),0)* equal(U,V)*. % 1.13/1.26 1439[0:Rew:66.0,1438.1] || -> less(U,0)* less(V,0)* equal(U,V)*. % 1.13/1.26 1440(e)[0:BLD:1439.1] || -> . % 1.13/1.26 % 1.13/1.26 % SZS output end CNFRefutation for /tmp/SPASST_31247_n015.cluster.edu % 1.13/1.26 % 1.13/1.26 Formulae used in the proof : fof_array_type fof_init_type fof_a fof_rev_n1_proper % 1.13/1.29 % 1.13/1.29 SPASS+T ended %------------------------------------------------------------------------------