TSTP Solution File: ARI698_1 by SPASS+T---2.2.22

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : ARI698_1 : TPTP v8.1.0. Released v6.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : spasst-tptp-script %s %d

% Computer : n020.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 : Thu Jul 14 22:18:40 EDT 2022

% Result   : Theorem 0.91s 1.12s
% Output   : Refutation 0.91s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ARI698_1 : TPTP v8.1.0. Released v6.3.0.
% 0.07/0.13  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 11:07:04 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  % Using integer theory
% 0.91/1.12  
% 0.91/1.12  
% 0.91/1.12  % SZS status Theorem for /tmp/SPASST_12864_n020.cluster.edu
% 0.91/1.12  
% 0.91/1.12  SPASS V 2.2.22  in combination with yices.
% 0.91/1.12  SPASS beiseite: Proof found by SPASS and SMT.
% 0.91/1.12  Problem: /tmp/SPASST_12864_n020.cluster.edu 
% 0.91/1.12  SPASS derived 745 clauses, backtracked 125 clauses and kept 465 clauses.
% 0.91/1.12  SPASS backtracked 3 times (1 times due to theory inconsistency).
% 0.91/1.12  SPASS allocated 7113 KBytes.
% 0.91/1.12  SPASS spent	0:00:00.10 on the problem.
% 0.91/1.12  		0:00:00.00 for the input.
% 0.91/1.12  		0:00:00.00 for the FLOTTER CNF translation.
% 0.91/1.12  		0:00:00.01 for inferences.
% 0.91/1.12  		0:00:00.00 for the backtracking.
% 0.91/1.12  		0:00:00.07 for the reduction.
% 0.91/1.12  		0:00:00.02 for interacting with the SMT procedure.
% 0.91/1.12  		
% 0.91/1.12  
% 0.91/1.12  % SZS output start CNFRefutation for /tmp/SPASST_12864_n020.cluster.edu
% 0.91/1.12  
% 0.91/1.12  % Here is a proof with depth 5, length 88 :
% 0.91/1.12  8[0:Inp] ||  -> equal(n,1000)**.
% 0.91/1.12  9[0:Inp] ||  -> equal(minus(minus(minus(minus(minus(times(n,x6),x5),x4),x3),x2),x1),0)**.
% 0.91/1.12  10[0:Inp] ||  -> equal(minus(minus(minus(minus(plus(times(n,x6),times(1,x5)),x4),x3),x2),x1),0)**.
% 0.91/1.12  11[0:Inp] ||  -> equal(minus(minus(minus(plus(plus(times(n,x6),times(0,x5)),times(0,x4)),x3),x2),x1),0)**.
% 0.91/1.12  12[0:Inp] ||  -> equal(minus(minus(plus(plus(plus(times(n,x6),times(0,x5)),times(0,x4)),times(1,x3)),x2),x1),0)**.
% 0.91/1.12  13[0:Inp] ||  -> equal(plus(plus(plus(minus(plus(times(n,x6),times(0,x5)),x4),times(1,x3)),times(1,x2)),times(1,x1)),0)**.
% 0.91/1.12  14[0:Inp] ||  -> equal(plus(minus(plus(plus(plus(times(n,x6),times(0,x5)),times(0,x4)),times(0,x3)),x2),times(1,x1)),0)**.
% 0.91/1.12  15[0:Inp] ||  -> equal(minus(plus(plus(plus(plus(times(n,x6),times(0,x5)),times(0,x4)),times(0,x3)),times(0,x2)),x1),0)**.
% 0.91/1.12  16[0:Inp] || equal(x6,0)** equal(x5,0) equal(x4,0) equal(x3,0) equal(x2,0) equal(x1,0) -> .
% 0.91/1.12  18[0:Inp] ||  -> equal(plus(plus(plus(plus(plus(times(n,x6),times(0,x5)),times(1,x4)),times(1,x3)),times(1,x2)),times(1,x1)),0)**.
% 0.91/1.12  19[0:Inp] ||  -> equal(plus(plus(plus(plus(plus(times(n,x6),times(0,x5)),times(0,x4)),times(0,x3)),times(1,x2)),times(1,x1)),0)**.
% 0.91/1.12  22[0:ThA] ||  -> equal(plus(uminus(U),plus(U,V)),V)**.
% 0.91/1.12  23[0:ThA] ||  -> equal(plus(plus(U,uminus(V)),V),U)**.
% 0.91/1.12  24[0:ThA] ||  -> equal(plus(plus(U,V),uminus(V)),U)**.
% 0.91/1.12  27[0:ThA] ||  -> equal(plus(U,0),U)**.
% 0.91/1.12  35[0:ThA] ||  -> lesseq(U,V) less(uminus(U),uminus(V))*.
% 0.91/1.12  39[0:ThA] ||  -> equal(times(1,U),U)**.
% 0.91/1.12  53[0:ArS:10.0] ||  -> equal(plus(plus(plus(plus(plus(times(n,x6),times(1,x5)),uminus(x4)),uminus(x3)),uminus(x2)),uminus(x1)),0)**.
% 0.91/1.12  54[0:Rew:8.0,53.0,39.0,53.0] ||  -> equal(plus(plus(plus(plus(plus(times(1000,x6),x5),uminus(x4)),uminus(x3)),uminus(x2)),uminus(x1)),0)**.
% 0.91/1.12  57[0:ArS:12.0] ||  -> equal(plus(plus(plus(plus(times(n,x6),0),times(1,x3)),uminus(x2)),uminus(x1)),0)**.
% 0.91/1.12  58[0:Rew:27.0,57.0,8.0,57.0,39.0,57.0] ||  -> equal(plus(plus(plus(times(1000,x6),x3),uminus(x2)),uminus(x1)),0)**.
% 0.91/1.12  61[0:ArS:14.0] ||  -> equal(plus(plus(plus(times(n,x6),0),uminus(x2)),times(1,x1)),0)**.
% 0.91/1.12  62[0:Rew:27.0,61.0,8.0,61.0,39.0,61.0] ||  -> equal(plus(plus(times(1000,x6),uminus(x2)),x1),0)**.
% 0.91/1.12  63[0:ArS:15.0] ||  -> equal(plus(plus(times(n,x6),0),uminus(x1)),0)**.
% 0.91/1.12  64[0:Rew:27.0,63.0,8.0,63.0] ||  -> equal(plus(times(1000,x6),uminus(x1)),0)**.
% 0.91/1.12  66[0:ArS:18.0] ||  -> equal(plus(plus(plus(plus(plus(times(n,x6),0),times(1,x4)),times(1,x3)),times(1,x2)),times(1,x1)),0)**.
% 0.91/1.12  67[0:Rew:27.0,66.0,8.0,66.0,39.0,66.0,39.0,66.0,39.0,66.0,39.0,66.0] ||  -> equal(plus(plus(plus(plus(times(1000,x6),x4),x3),x2),x1),0)**.
% 0.91/1.12  68[0:ArS:19.0] ||  -> equal(plus(plus(plus(times(n,x6),0),times(1,x2)),times(1,x1)),0)**.
% 0.91/1.12  69[0:Rew:27.0,68.0,8.0,68.0,39.0,68.0,39.0,68.0] ||  -> equal(plus(plus(times(1000,x6),x2),x1),0)**.
% 0.91/1.12  73[0:SpR:64.0,23.0] ||  -> equal(times(1000,x6),plus(0,x1))**.
% 0.91/1.12  75[0:SpR:64.0,22.0] ||  -> equal(plus(uminus(times(1000,x6)),0),uminus(x1))**.
% 0.91/1.12  81[0:ArS:73.0] ||  -> equal(times(1000,x6),plus(x1,0))**.
% 0.91/1.12  82[0:Rew:27.0,81.0] ||  -> equal(times(1000,x6),x1)**.
% 0.91/1.12  84[0:Rew:82.0,69.0] ||  -> equal(plus(plus(x1,x2),x1),0)**.
% 0.91/1.12  85[0:Rew:82.0,62.0] ||  -> equal(plus(plus(x1,uminus(x2)),x1),0)**.
% 0.91/1.12  86[0:Rew:82.0,58.0] ||  -> equal(plus(plus(plus(x1,x3),uminus(x2)),uminus(x1)),0)**.
% 0.91/1.12  87[0:Rew:82.0,67.0] ||  -> equal(plus(plus(plus(plus(x1,x4),x3),x2),x1),0)**.
% 0.91/1.12  90[0:Rew:82.0,54.0] ||  -> equal(plus(plus(plus(plus(plus(x1,x5),uminus(x4)),uminus(x3)),uminus(x2)),uminus(x1)),0)**.
% 0.91/1.12  94[0:ArS:75.0] ||  -> equal(plus(times(-1000,x6),0),uminus(x1))**.
% 0.91/1.12  95[0:Rew:27.0,94.0] ||  -> equal(times(-1000,x6),uminus(x1))**.
% 0.91/1.12  102[0:SpR:84.0,24.0] ||  -> equal(plus(x1,x2),plus(0,uminus(x1)))**.
% 0.91/1.12  109[0:ArS:102.0] ||  -> equal(plus(x1,x2),plus(uminus(x1),0))**.
% 0.91/1.12  110[0:Rew:27.0,109.0] ||  -> equal(plus(x1,x2),uminus(x1))**.
% 0.91/1.12  120[0:SpR:110.0,22.0] ||  -> equal(plus(uminus(x1),uminus(x1)),x2)**.
% 0.91/1.12  155[0:SpR:85.0,24.0] ||  -> equal(plus(x1,uminus(x2)),plus(0,uminus(x1)))**.
% 0.91/1.12  162[0:ArS:155.0] ||  -> equal(plus(x1,uminus(x2)),plus(uminus(x1),0))**.
% 0.91/1.12  163[0:Rew:27.0,162.0] ||  -> equal(plus(x1,uminus(x2)),uminus(x1))**.
% 0.91/1.12  192[0:SpR:163.0,22.0] ||  -> equal(plus(uminus(x1),uminus(x1)),uminus(x2))**.
% 0.91/1.12  198[0:Rew:120.0,192.0] ||  -> equal(uminus(x2),x2)**.
% 0.91/1.12  203[0:Rew:198.0,86.0] ||  -> equal(plus(plus(plus(x1,x3),x2),uminus(x1)),0)**.
% 0.91/1.12  205[0:Rew:198.0,90.0] ||  -> equal(plus(plus(plus(plus(plus(x1,x5),uminus(x4)),uminus(x3)),x2),uminus(x1)),0)**.
% 0.91/1.12  228[0:SpR:198.0,35.1] ||  -> lesseq(x2,U) less(x2,uminus(U))*.
% 0.91/1.12  229[0:SpR:198.0,23.0] ||  -> equal(plus(plus(U,x2),x2),U)**.
% 0.91/1.12  231[0:SpR:198.0,35.1] ||  -> lesseq(U,x2) less(uminus(U),x2)*.
% 0.91/1.12  234[0:SpR:203.0,23.0] ||  -> equal(plus(plus(x1,x3),x2),plus(0,x1))**.
% 0.91/1.12  242[0:ArS:234.0] ||  -> equal(plus(plus(x1,x3),x2),plus(x1,0))**.
% 0.91/1.12  243[0:Rew:27.0,242.0] ||  -> equal(plus(plus(x1,x3),x2),x1)**.
% 0.91/1.12  292[0:SpR:87.0,24.0] ||  -> equal(plus(plus(plus(x1,x4),x3),x2),plus(0,uminus(x1)))**.
% 0.91/1.12  299[0:ArS:292.0] ||  -> equal(plus(plus(plus(x1,x4),x3),x2),plus(uminus(x1),0))**.
% 0.91/1.12  300[0:Rew:27.0,299.0] ||  -> equal(plus(plus(plus(x1,x4),x3),x2),uminus(x1))**.
% 0.91/1.12  309[0:SpR:243.0,24.0] ||  -> equal(plus(x1,uminus(x2)),plus(x1,x3))**.
% 0.91/1.12  315[0:Rew:110.0,309.0,198.0,309.0] ||  -> equal(plus(x1,x3),uminus(x1))**.
% 0.91/1.12  325[0:SpR:315.0,22.0] ||  -> equal(plus(uminus(x1),uminus(x1)),x3)**.
% 0.91/1.12  330[0:Rew:120.0,325.0] ||  -> equal(x3,x2)**.
% 0.91/1.12  333[0:Rew:330.0,16.3] || equal(x6,0)** equal(x5,0) equal(x4,0) equal(x2,0) equal(x2,0) equal(x1,0) -> .
% 0.91/1.12  336[0:Rew:330.0,205.0] ||  -> equal(plus(plus(plus(plus(plus(x1,x5),uminus(x4)),uminus(x2)),x2),uminus(x1)),0)**.
% 0.91/1.12  339[0:Rew:330.0,300.0] ||  -> equal(plus(plus(plus(x1,x4),x2),x2),uminus(x1))**.
% 0.91/1.12  345[0:Rew:229.0,339.0] ||  -> equal(plus(x1,x4),uminus(x1))**.
% 0.91/1.12  349[0:Rew:198.0,336.0] ||  -> equal(plus(plus(plus(plus(plus(x1,x5),uminus(x4)),x2),x2),uminus(x1)),0)**.
% 0.91/1.12  350[0:Rew:229.0,349.0] ||  -> equal(plus(plus(plus(x1,x5),uminus(x4)),uminus(x1)),0)**.
% 0.91/1.12  353[0:Obv:333.3] || equal(x6,0)** equal(x5,0) equal(x4,0) equal(x2,0) equal(x1,0) -> .
% 0.91/1.12  357[0:SpR:345.0,22.0] ||  -> equal(plus(uminus(x1),uminus(x1)),x4)**.
% 0.91/1.12  362[0:Rew:120.0,357.0] ||  -> equal(x4,x2)**.
% 0.91/1.12  365[0:Rew:362.0,350.0] ||  -> equal(plus(plus(plus(x1,x5),uminus(x2)),uminus(x1)),0)**.
% 0.91/1.12  369[0:Rew:362.0,353.2] || equal(x6,0)** equal(x5,0) equal(x2,0) equal(x2,0) equal(x1,0) -> .
% 0.91/1.12  377[0:Rew:198.0,365.0] ||  -> equal(plus(plus(plus(x1,x5),x2),uminus(x1)),0)**.
% 0.91/1.12  379[0:Obv:369.2] || equal(x6,0)** equal(x5,0) equal(x2,0) equal(x1,0) -> .
% 0.91/1.12  381[0:SpR:377.0,23.0] ||  -> equal(plus(plus(x1,x5),x2),plus(0,x1))**.
% 0.91/1.12  389[0:ArS:381.0] ||  -> equal(plus(plus(x1,x5),x2),plus(x1,0))**.
% 0.91/1.12  390[0:Rew:27.0,389.0] ||  -> equal(plus(plus(x1,x5),x2),x1)**.
% 0.91/1.12  402[0:SpR:390.0,24.0] ||  -> equal(plus(x1,uminus(x2)),plus(x1,x5))**.
% 0.91/1.12  408[0:Rew:110.0,402.0,198.0,402.0] ||  -> equal(plus(x1,x5),uminus(x1))**.
% 0.91/1.12  418[0:SpR:408.0,22.0] ||  -> equal(plus(uminus(x1),uminus(x1)),x5)**.
% 0.91/1.12  423[0:Rew:120.0,418.0] ||  -> equal(x5,x2)**.
% 0.91/1.12  483[0:OCE:231.1,228.1] ||  -> lesseq(U,x2)* lesseq(x2,U)*.
% 0.91/1.12  509[0:OCE:483.0,228.1] ||  -> lesseq(x2,uminus(U))* lesseq(x2,U).
% 0.91/1.12  512[0:OCE:483.1,231.1] ||  -> lesseq(uminus(U),x2)* lesseq(U,x2).
% 0.91/1.12  1442(e)[0:ThR:512,509,423,379,95,69,13,12,11,10,9] ||  -> .
% 0.91/1.12  
% 0.91/1.12  % SZS output end CNFRefutation for /tmp/SPASST_12864_n020.cluster.edu
% 0.91/1.12  
% 0.91/1.12  Formulae used in the proof : fof_x_type fof_eq1 fof_eq3 fof_eq4 fof_eq7 fof_eq8 fof_eq6 fof_eq10 fof_eq11 fof_eq2 fof_eq5
% 0.91/1.13  
% 0.91/1.13  SPASS+T ended
%------------------------------------------------------------------------------