TSTP Solution File: SEU373+2 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU373+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% 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 : Tue Jul 19 14:36:44 EDT 2022

% Result   : Theorem 224.85s 225.07s
% Output   : Refutation 224.85s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU373+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n015.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jun 19 23:25:15 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 224.85/225.07  
% 224.85/225.07  SPASS V 3.9 
% 224.85/225.07  SPASS beiseite: Proof found.
% 224.85/225.07  % SZS status Theorem
% 224.85/225.07  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 224.85/225.07  SPASS derived 164 clauses, backtracked 0 clauses, performed 0 splits and kept 1968 clauses.
% 224.85/225.07  SPASS allocated 195672 KBytes.
% 224.85/225.07  SPASS spent	0:3:44.59 on the problem.
% 224.85/225.07  		0:00:00.05 for the input.
% 224.85/225.07  		0:3:42.81 for the FLOTTER CNF translation.
% 224.85/225.07  		0:00:00.00 for inferences.
% 224.85/225.07  		0:00:00.00 for the backtracking.
% 224.85/225.07  		0:00:01.08 for the reduction.
% 224.85/225.07  
% 224.85/225.07  
% 224.85/225.07  Here is a proof with depth 1, length 17 :
% 224.85/225.07  % SZS output start Refutation
% 224.85/225.07  1[0:Inp] ||  -> one_sorted_str(skc47)*.
% 224.85/225.07  194[0:Inp] ||  -> net_str(skc48,skc47)*.
% 224.85/225.07  335[0:Inp] ||  -> subnetstr(skc49,skc47,skc48)*.
% 224.85/225.07  463[0:Inp] || subset(the_carrier(skc49),the_carrier(skc48))*l -> .
% 224.85/225.07  813[0:Inp] one_sorted_str(u) || net_str(v,u)* -> rel_str(v).
% 224.85/225.07  814[0:Inp] rel_str(u) || subrelstr(v,u)* -> rel_str(v).
% 224.85/225.07  1345[0:Inp] rel_str(u) rel_str(v) || subrelstr(v,u)* -> subset(the_carrier(v),the_carrier(u)).
% 224.85/225.07  1354[0:Inp] one_sorted_str(u) || net_str(v,u) subnetstr(w,u,v)* -> net_str(w,u).
% 224.85/225.07  1566[0:Inp] one_sorted_str(u) || subnetstr(v,u,w)* net_str(w,u) net_str(v,u) -> subrelstr(v,w).
% 224.85/225.07  2366[0:MRR:1566.3,1354.3] one_sorted_str(u) || net_str(v,u) subnetstr(w,u,v)* -> subrelstr(w,v).
% 224.85/225.07  2375[0:MRR:1345.1,814.2] rel_str(u) || subrelstr(v,u)* -> subset(the_carrier(v),the_carrier(u)).
% 224.85/225.07  2787[0:Res:194.0,813.1] one_sorted_str(skc47) ||  -> rel_str(skc48)*.
% 224.85/225.07  2798[0:Res:335.0,2366.1] one_sorted_str(skc47) || net_str(skc48,skc47) -> subrelstr(skc49,skc48)*.
% 224.85/225.07  2818[0:Res:2375.2,463.0] rel_str(skc48) || subrelstr(skc49,skc48)* -> .
% 224.85/225.07  2820[0:MRR:2787.0,1.0] ||  -> rel_str(skc48)*.
% 224.85/225.07  2822[0:MRR:2818.0,2820.0] || subrelstr(skc49,skc48)* -> .
% 224.85/225.07  2824[0:MRR:2798.0,2798.1,2798.2,1.0,194.0,2822.0] ||  -> .
% 224.85/225.07  % SZS output end Refutation
% 224.85/225.07  Formulae used in the proof : t19_yellow_6 dt_l1_waybel_0 dt_m1_yellow_0 d13_yellow_0 dt_m1_yellow_6 d8_yellow_6
% 224.85/225.07  
%------------------------------------------------------------------------------