TSTP Solution File: FLD060-4 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : FLD060-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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 02:28:35 EDT 2022

% Result   : Unsatisfiable 25.42s 25.59s
% Output   : Refutation 25.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : FLD060-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n023.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 : Mon Jun  6 21:00:54 EDT 2022
% 0.19/0.33  % CPUTime  : 
% 25.42/25.59  
% 25.42/25.59  SPASS V 3.9 
% 25.42/25.59  SPASS beiseite: Proof found.
% 25.42/25.59  % SZS status Theorem
% 25.42/25.59  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 25.42/25.59  SPASS derived 18243 clauses, backtracked 1701 clauses, performed 18 splits and kept 12553 clauses.
% 25.42/25.59  SPASS allocated 93608 KBytes.
% 25.42/25.59  SPASS spent	0:0:24.57 on the problem.
% 25.42/25.59  		0:00:00.04 for the input.
% 25.42/25.59  		0:00:00.00 for the FLOTTER CNF translation.
% 25.42/25.59  		0:00:00.17 for inferences.
% 25.42/25.59  		0:00:00.95 for the backtracking.
% 25.42/25.59  		0:0:23.22 for the reduction.
% 25.42/25.59  
% 25.42/25.59  
% 25.42/25.59  Here is a proof with depth 3, length 21 :
% 25.42/25.59  % SZS output start Refutation
% 25.42/25.59  1[0:Inp] ||  -> defined(a)*.
% 25.42/25.59  2[0:Inp] ||  -> defined(b)*.
% 25.42/25.59  5[0:Inp] ||  -> less_or_equal(a,b)*l.
% 25.42/25.59  6[0:Inp] ||  -> sum__dfg(a,a,u__dfg)*.
% 25.42/25.59  7[0:Inp] ||  -> sum__dfg(b,b,v__dfg)*.
% 25.42/25.59  8[0:Inp] || less_or_equal(u__dfg,v__dfg)*l -> .
% 25.42/25.59  13[0:Inp] || sum__dfg(u,v,w)*+ -> sum__dfg(v,u,w)*.
% 25.42/25.59  27[0:Inp] defined(u) defined(v) ||  -> sum__dfg(v,u,add(v,u))*.
% 25.42/25.59  30[0:Inp] || less_or_equal(u,v)* less_or_equal(v,w)* -> less_or_equal(u,w)*.
% 25.42/25.59  32[0:Inp] || less_or_equal(u,v)*+ sum__dfg(v,w,x)* sum__dfg(u,w,y)* -> less_or_equal(y,x)*.
% 25.42/25.59  45[0:Res:7.0,32.2] || less_or_equal(u,b) sum__dfg(u,b,v)* -> less_or_equal(v,v__dfg).
% 25.42/25.59  53[0:Res:6.0,32.1] || less_or_equal(a,u) sum__dfg(u,a,v)* -> less_or_equal(u__dfg,v).
% 25.42/25.59  118[0:Res:27.2,13.0] defined(u) defined(v) ||  -> sum__dfg(u,v,add(v,u))*.
% 25.42/25.59  2604[0:Res:27.2,53.1] defined(a) defined(u) || less_or_equal(a,u) -> less_or_equal(u__dfg,add(u,a))*r.
% 25.42/25.59  2621[0:SSi:2604.0,1.0] defined(u) || less_or_equal(a,u) -> less_or_equal(u__dfg,add(u,a))*r.
% 25.42/25.59  2664[0:Res:118.2,45.1] defined(u) defined(b) || less_or_equal(u,b) -> less_or_equal(add(b,u),v__dfg)*l.
% 25.42/25.59  2682[0:SSi:2664.1,2.0] defined(u) || less_or_equal(u,b) -> less_or_equal(add(b,u),v__dfg)*l.
% 25.42/25.59  24278[0:OCh:30.1,30.0,2682.2,2621.2] defined(a) defined(b) || less_or_equal(a,b)*l less_or_equal(a,b)*l -> less_or_equal(u__dfg,v__dfg).
% 25.42/25.59  24300[0:Obv:24278.2] defined(a) defined(b) || less_or_equal(a,b)*l -> less_or_equal(u__dfg,v__dfg).
% 25.42/25.59  24301[0:SSi:24300.1,24300.0,2.0,1.0] || less_or_equal(a,b)*l -> less_or_equal(u__dfg,v__dfg).
% 25.42/25.59  24302[0:MRR:24301.0,24301.1,5.0,8.0] ||  -> .
% 25.42/25.59  % SZS output end Refutation
% 25.42/25.59  Formulae used in the proof : a_is_defined b_is_defined less_or_equal_5 sum_6 sum_7 not_less_or_equal_8 commutativity_addition totality_of_addition transitivity_of_order_relation compatibility_of_order_relation_and_addition
% 25.42/25.59  
%------------------------------------------------------------------------------