TSTP Solution File: DAT054_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : DAT054_1 : TPTP v8.1.0. Released v5.0.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:31:59 EDT 2022
% Result : Unknown 79.37s 40.40s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT054_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.12 % Command : spasst-tptp-script %s %d
% 0.13/0.33 % Computer : n015.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 : Fri Jul 1 18:45:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 % Using integer theory
% 79.37/40.40
% 79.37/40.40
% 79.37/40.40 % SZS status Incomplete for /tmp/SPASST_26342_n015.cluster.edu
% 79.37/40.40
% 79.37/40.40 SPASS V 2.2.22 in combination with yices.
% 79.37/40.40 SPASS beiseite: Unknown (SPASS (with standard axioms): completion, SMT procedure: unknown).
% 79.37/40.40 Problem: /tmp/SPASST_26342_n015.cluster.edu
% 79.37/40.40 SPASS derived 25 clauses, backtracked 0 clauses and kept 45 clauses.
% 79.37/40.40 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 79.37/40.40 SPASS allocated 6243 KBytes.
% 79.37/40.40 SPASS spent 0:00:39.38 on the problem.
% 79.37/40.40 0:00:00.00 for the input.
% 79.37/40.40 0:00:00.00 for the FLOTTER CNF translation.
% 79.37/40.40 0:00:00.00 for inferences.
% 79.37/40.40 0:00:00.00 for the backtracking.
% 79.37/40.40 0:00:00.00 for the reduction.
% 79.37/40.40 0:00:39.37 for interacting with the SMT procedure.
% 79.37/40.40
% 79.37/40.40
% 79.37/40.40 % SZS output start ListOfCNF for /tmp/SPASST_26342_n015.cluster.edu
% 79.37/40.40
% 79.37/40.40 The saturated set of worked-off clauses is :
% 79.37/40.40 43[0:MRR:10.2,8.1] || element(U) iselem(U) iselem(next(next(U))) -> less(data(next(U)),data(U))*.
% 79.37/40.40 60[0:Res:3.0,43.2] || iselem(skc1) iselem(next(next(skc1))) -> less(data(next(skc1)),data(skc1))*.
% 79.37/40.40 9[0:Inp] || element(U) iselem(U) -> less(0,data(U))*.
% 79.37/40.40 54[0:Res:3.0,9.1] || iselem(skc1) -> less(0,data(skc1))*.
% 79.37/40.40 8[0:Inp] || element(U) -> element(next(U))*.
% 79.37/40.40 63[0:MRR:48.0,48.1,4.0,2.0] || -> less(data(next(a)),data(a))*.
% 79.37/40.40 62[0:MRR:45.0,2.0] || -> less(0,data(a))*.
% 79.37/40.40 6[0:Inp] || -> iselem(next(next(a)))*.
% 79.37/40.40 42[0:TOC:7.0] || -> less(data(a),3)*.
% 79.37/40.40 5[0:Inp] || -> iselem(next(a))*.
% 79.37/40.40 4[0:Inp] || -> iselem(a)*.
% 79.37/40.40 2[0:Inp] || -> element(a)*.
% 79.37/40.40 3[0:Inp] || -> element(skc1)*.
% 79.37/40.40 1[0:Inp] || -> true*.
% 79.37/40.40 24[0:ThA] || -> lesseq(U,V) less(plus(V,W),plus(U,W))*.
% 79.37/40.40 25[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*.
% 79.37/40.40 23[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*.
% 79.37/40.40 26[0:ThA] || -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 79.37/40.40 12[0:ThA] || -> equal(plus(U,plus(uminus(U),V)),V)**.
% 79.37/40.40 13[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**.
% 79.37/40.40 15[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**.
% 79.37/40.40 14[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**.
% 79.37/40.40 35[0:ThA] || evaleq(U,V)* -> equal(U,V).
% 79.37/40.40 31[0:ThA] || -> equal(times(U,-1),uminus(U))**.
% 79.37/40.40 16[0:ThA] || -> equal(plus(U,uminus(U)),0)**.
% 79.37/40.40 32[0:ThA] || -> equal(times(-1,U),uminus(U))**.
% 79.37/40.40 17[0:ThA] || -> equal(plus(uminus(U),U),0)**.
% 79.37/40.40 21[0:ThA] || -> less(U,plus(U,1))*.
% 79.37/40.40 11[0:ThA] || -> equal(uminus(uminus(U)),U)**.
% 79.37/40.40 22[0:ThA] || -> less(plus(U,-1),U)*.
% 79.37/40.40 18[0:ThA] || -> equal(plus(U,0),U)**.
% 79.37/40.40 29[0:ThA] || -> equal(times(U,1),U)**.
% 79.37/40.40 33[0:ThA] || -> equal(divide_nat(U,1),U)**.
% 79.37/40.40 27[0:ThA] || -> equal(times(U,0),0)**.
% 79.37/40.40 34[0:ThA] || -> equal(remainder(U,1),0)**.
% 79.37/40.40 19[0:ThA] || -> equal(plus(0,U),U)**.
% 79.37/40.40 30[0:ThA] || -> equal(times(1,U),U)**.
% 79.37/40.40 28[0:ThA] || -> equal(times(0,U),0)**.
% 79.37/40.40 40[0:ThA] || -> equal(floor(U),U)**.
% 79.37/40.40 41[0:ThA] || -> equal(ceiling(U),U)**.
% 79.37/40.40 20[0:ThA] || -> lesseq(U,U)*.
% 79.37/40.40 36[0:ThA] || -> evaleq(0,0)*.
% 79.37/40.40 37[0:ThA] || -> evaleq(1,1)*.
% 79.37/40.40 38[0:ThA] || -> isint(U)*.
% 79.37/40.40 39[0:ThA] || -> israt(U)*.
% 79.37/40.40
% 79.37/40.40 % SZS output end ListOfCNF for /tmp/SPASST_26342_n015.cluster.edu
% 79.37/40.40 SPASS+T ended
%------------------------------------------------------------------------------