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

View Problem - Process Solution

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

% Computer : n017.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 : Fri Jul 15 23:24:47 EDT 2022

% Result   : Theorem 2.17s 2.39s
% Output   : Refutation 2.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : CSR056+2 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.14  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n017.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 : Sat Jun 11 10:27:21 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.17/2.39  
% 2.17/2.39  SPASS V 3.9 
% 2.17/2.39  SPASS beiseite: Proof found.
% 2.17/2.39  % SZS status Theorem
% 2.17/2.39  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 2.17/2.39  SPASS derived 3693 clauses, backtracked 0 clauses, performed 0 splits and kept 3719 clauses.
% 2.17/2.39  SPASS allocated 101143 KBytes.
% 2.17/2.39  SPASS spent	0:00:01.97 on the problem.
% 2.17/2.39  		0:00:00.05 for the input.
% 2.17/2.39  		0:00:00.17 for the FLOTTER CNF translation.
% 2.17/2.39  		0:00:00.11 for inferences.
% 2.17/2.39  		0:00:00.00 for the backtracking.
% 2.17/2.39  		0:00:01.28 for the reduction.
% 2.17/2.39  
% 2.17/2.39  
% 2.17/2.39  Here is a proof with depth 3, length 18 :
% 2.17/2.39  % SZS output start Refutation
% 2.17/2.39  1[0:Inp] ||  -> mtvisible(c_tptp_member3717_mt)*.
% 2.17/2.39  140[0:Inp] ||  -> genlmt(c_tptp_spindleheadmt,c_cyclistsmt)*r.
% 2.17/2.39  155[0:Inp] ||  -> genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt)*l.
% 2.17/2.39  268[0:Inp] || tptpofobject(c_tptpartsupplies,u)* -> .
% 2.17/2.39  303[0:Inp] || mtvisible(c_cyclistsmt) -> artsupplies(c_tptpartsupplies)*.
% 2.17/2.39  361[0:Inp] artsupplies(u) ||  -> supplies(u)*.
% 2.17/2.39  997[0:Inp] || genlmt(u,v)*+ -> microtheory(u)*.
% 2.17/2.39  1082[0:Inp] mtvisible(u) || genlmt(u,v)*+ -> mtvisible(v)*.
% 2.17/2.39  1086[0:Inp] supplies(u) || mtvisible(c_tptp_spindleheadmt) -> tptpofobject(u,f_tptpquantityfn_14(n_232))*.
% 2.17/2.39  1137[0:Res:1086.2,268.0] supplies(c_tptpartsupplies) || mtvisible(c_tptp_spindleheadmt)* -> .
% 2.17/2.39  1636[0:SoR:1137.0,361.1] artsupplies(c_tptpartsupplies) || mtvisible(c_tptp_spindleheadmt)* -> .
% 2.17/2.39  1640[0:SoR:1636.0,303.1] || mtvisible(c_tptp_spindleheadmt) mtvisible(c_cyclistsmt)* -> .
% 2.17/2.39  4189[0:Res:155.0,997.0] ||  -> microtheory(c_tptp_member3717_mt)*.
% 2.17/2.39  5148[0:Res:155.0,1082.1] mtvisible(c_tptp_member3717_mt) ||  -> mtvisible(c_tptp_spindleheadmt)*.
% 2.17/2.39  5196[0:Res:140.0,1082.1] mtvisible(c_tptp_spindleheadmt) ||  -> mtvisible(c_cyclistsmt)*.
% 2.17/2.39  5296[0:SSi:5148.0,1.0,4189.0] ||  -> mtvisible(c_tptp_spindleheadmt)*.
% 2.17/2.39  5301[0:MRR:1640.0,5296.0] || mtvisible(c_cyclistsmt)* -> .
% 2.17/2.39  5322[0:MRR:5196.0,5196.1,5296.0,5301.0] ||  -> .
% 2.17/2.39  % SZS output end Refutation
% 2.17/2.39  Formulae used in the proof : query106 ax1_254 ax1_279 ax1_40 ax1_238 ax1_1127 ax1_1123 ax1_202
% 2.17/2.39  
%------------------------------------------------------------------------------