TSTP Solution File: SEU240+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n016.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:35:25 EDT 2022

% Result   : Theorem 0.18s 0.50s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU240+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n016.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 20 01:35:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.18/0.50  
% 0.18/0.50  SPASS V 3.9 
% 0.18/0.50  SPASS beiseite: Proof found.
% 0.18/0.50  % SZS status Theorem
% 0.18/0.50  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.50  SPASS derived 346 clauses, backtracked 51 clauses, performed 2 splits and kept 205 clauses.
% 0.18/0.50  SPASS allocated 98138 KBytes.
% 0.18/0.50  SPASS spent	0:00:00.15 on the problem.
% 0.18/0.50  		0:00:00.04 for the input.
% 0.18/0.50  		0:00:00.06 for the FLOTTER CNF translation.
% 0.18/0.50  		0:00:00.01 for inferences.
% 0.18/0.50  		0:00:00.00 for the backtracking.
% 0.18/0.50  		0:00:00.02 for the reduction.
% 0.18/0.50  
% 0.18/0.50  
% 0.18/0.50  Here is a proof with depth 3, length 48 :
% 0.18/0.50  % SZS output start Refutation
% 0.18/0.50  1[0:Inp] ||  -> relation(skc9)*.
% 0.18/0.50  25[0:Inp] || transitive(skc9) -> in(ordered_pair(skc12,skc11),skc9)*.
% 0.18/0.50  26[0:Inp] || transitive(skc9) -> in(ordered_pair(skc11,skc10),skc9)*.
% 0.18/0.50  28[0:Inp] || transitive(skc9) in(ordered_pair(skc12,skc10),skc9)* -> .
% 0.18/0.50  31[0:Inp] relation(u) transitive(u) ||  -> is_transitive_in(u,relation_field(u))*.
% 0.18/0.50  32[0:Inp] relation(u) || is_transitive_in(u,relation_field(u))* -> transitive(u).
% 0.18/0.50  39[0:Inp] relation(u) || in(ordered_pair(v,w),u)* -> in(v,relation_field(u)).
% 0.18/0.50  40[0:Inp] relation(u) || in(ordered_pair(v,w),u)* -> in(w,relation_field(u)).
% 0.18/0.50  41[0:Inp] relation(u) ||  -> is_transitive_in(u,v) in(ordered_pair(skf6(v,u),skf5(v,u)),u)*.
% 0.18/0.50  42[0:Inp] relation(u) ||  -> is_transitive_in(u,v) in(ordered_pair(skf5(v,u),skf4(v,u)),u)*.
% 0.18/0.50  43[0:Inp] relation(u) || in(ordered_pair(skf6(v,u),skf4(v,u)),u)* -> is_transitive_in(u,v).
% 0.18/0.50  44[0:Inp] || in(ordered_pair(u,v),skc9)*+ in(ordered_pair(w,u),skc9)* -> transitive(skc9) in(ordered_pair(w,v),skc9)*.
% 0.18/0.50  45[0:Inp] relation(u) || is_transitive_in(u,v)* in(w,v)* in(x,v)* in(y,v)* in(ordered_pair(x,w),u)*+ in(ordered_pair(y,x),u)* -> in(ordered_pair(y,w),u)*.
% 0.18/0.50  49[0:Res:1.0,43.0] || in(ordered_pair(skf6(u,skc9),skf4(u,skc9)),skc9)* -> is_transitive_in(skc9,u).
% 0.18/0.50  51[0:Res:1.0,42.0] ||  -> is_transitive_in(skc9,u) in(ordered_pair(skf5(u,skc9),skf4(u,skc9)),skc9)*.
% 0.18/0.50  52[0:Res:1.0,39.0] || in(ordered_pair(u,v),skc9)* -> in(u,relation_field(skc9)).
% 0.18/0.50  53[0:Res:1.0,40.0] || in(ordered_pair(u,v),skc9)* -> in(v,relation_field(skc9)).
% 0.18/0.50  60[0:Res:1.0,32.0] || is_transitive_in(skc9,relation_field(skc9))* -> transitive(skc9).
% 0.18/0.50  61[1:Spt:44.0,44.1,44.3] || in(ordered_pair(u,v),skc9)*+ in(ordered_pair(w,u),skc9)* -> in(ordered_pair(w,v),skc9)*.
% 0.18/0.50  62[2:Spt:26.0] || transitive(skc9)* -> .
% 0.18/0.50  63[2:MRR:60.1,62.0] || is_transitive_in(skc9,relation_field(skc9))* -> .
% 0.18/0.50  167[1:Res:51.1,61.0] || in(ordered_pair(u,skf5(v,skc9)),skc9)* -> is_transitive_in(skc9,v) in(ordered_pair(u,skf4(v,skc9)),skc9).
% 0.18/0.50  321[1:Res:41.2,167.0] relation(skc9) ||  -> is_transitive_in(skc9,u) is_transitive_in(skc9,u) in(ordered_pair(skf6(u,skc9),skf4(u,skc9)),skc9)*.
% 0.18/0.50  325[1:Obv:321.1] relation(skc9) ||  -> is_transitive_in(skc9,u) in(ordered_pair(skf6(u,skc9),skf4(u,skc9)),skc9)*.
% 0.18/0.50  326[1:SSi:325.0,1.0] ||  -> is_transitive_in(skc9,u) in(ordered_pair(skf6(u,skc9),skf4(u,skc9)),skc9)*.
% 0.18/0.50  327[1:MRR:326.1,49.0] ||  -> is_transitive_in(skc9,u)*.
% 0.18/0.50  328[2:UnC:327.0,63.0] ||  -> .
% 0.18/0.50  329[2:Spt:328.0,26.0,62.0] ||  -> transitive(skc9)*.
% 0.18/0.50  330[2:Spt:328.0,26.1] ||  -> in(ordered_pair(skc11,skc10),skc9)*.
% 0.18/0.50  331[2:MRR:25.0,329.0] ||  -> in(ordered_pair(skc12,skc11),skc9)*.
% 0.18/0.50  332[2:MRR:28.0,329.0] || in(ordered_pair(skc12,skc10),skc9)* -> .
% 0.18/0.50  337[2:Res:330.0,61.0] || in(ordered_pair(u,skc11),skc9)* -> in(ordered_pair(u,skc10),skc9).
% 0.18/0.50  358[2:Res:331.0,337.0] ||  -> in(ordered_pair(skc12,skc10),skc9)*.
% 0.18/0.50  359[2:MRR:358.0,332.0] ||  -> .
% 0.18/0.50  360[1:Spt:359.0,44.2] ||  -> transitive(skc9)*.
% 0.18/0.50  362[1:MRR:25.0,360.0] ||  -> in(ordered_pair(skc12,skc11),skc9)*.
% 0.18/0.50  363[1:MRR:26.0,360.0] ||  -> in(ordered_pair(skc11,skc10),skc9)*.
% 0.18/0.50  364[1:MRR:28.0,360.0] || in(ordered_pair(skc12,skc10),skc9)* -> .
% 0.18/0.50  366[1:Res:362.0,52.0] ||  -> in(skc12,relation_field(skc9))*.
% 0.18/0.50  367[1:Res:362.0,53.0] ||  -> in(skc11,relation_field(skc9))*.
% 0.18/0.50  379[1:Res:363.0,53.0] ||  -> in(skc10,relation_field(skc9))*.
% 0.18/0.50  383[1:Res:363.0,45.5] relation(skc9) || is_transitive_in(skc9,u)* in(skc10,u) in(skc11,u) in(v,u)* in(ordered_pair(v,skc11),skc9)* -> in(ordered_pair(v,skc10),skc9).
% 0.18/0.50  385[1:SSi:383.0,1.0,360.0] || is_transitive_in(skc9,u)* in(skc10,u) in(skc11,u) in(v,u)* in(ordered_pair(v,skc11),skc9)*+ -> in(ordered_pair(v,skc10),skc9).
% 0.18/0.50  473[1:Res:362.0,385.4] || is_transitive_in(skc9,u)* in(skc10,u) in(skc11,u) in(skc12,u) -> in(ordered_pair(skc12,skc10),skc9)*.
% 0.18/0.50  474[1:MRR:473.4,364.0] || is_transitive_in(skc9,u)* in(skc10,u) in(skc11,u) in(skc12,u) -> .
% 0.18/0.50  475[1:Res:31.2,474.0] relation(skc9) transitive(skc9) || in(skc10,relation_field(skc9)) in(skc11,relation_field(skc9)) in(skc12,relation_field(skc9))* -> .
% 0.18/0.50  481[1:SSi:475.1,475.0,1.0,360.0,1.0,360.0] || in(skc10,relation_field(skc9)) in(skc11,relation_field(skc9)) in(skc12,relation_field(skc9))* -> .
% 0.18/0.50  482[1:MRR:481.0,481.1,481.2,379.0,367.0,366.0] ||  -> .
% 0.18/0.50  % SZS output end Refutation
% 0.18/0.50  Formulae used in the proof : l2_wellord1 d16_relat_2 t30_relat_1 d8_relat_2
% 0.18/0.50  
%------------------------------------------------------------------------------