↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET932+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n005.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 05:29:55 EDT 2022

% Result   : Theorem 0.19s 0.46s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET932+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n005.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul 11 05:13:52 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  
% 0.19/0.46  SPASS V 3.9 
% 0.19/0.46  SPASS beiseite: Proof found.
% 0.19/0.46  % SZS status Theorem
% 0.19/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.46  SPASS derived 199 clauses, backtracked 0 clauses, performed 0 splits and kept 122 clauses.
% 0.19/0.46  SPASS allocated 85312 KBytes.
% 0.19/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.46  		0:00:00.03 for the input.
% 0.19/0.46  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.46  		0:00:00.01 for inferences.
% 0.19/0.46  		0:00:00.00 for the backtracking.
% 0.19/0.46  		0:00:00.02 for the reduction.
% 0.19/0.46  
% 0.19/0.46  
% 0.19/0.46  Here is a proof with depth 4, length 15 :
% 0.19/0.46  % SZS output start Refutation
% 0.19/0.46  2[0:Inp] ||  -> subset(skc4,skc5)*r.
% 0.19/0.46  5[0:Inp] || subset(powerset(skc4),powerset(skc5))*r -> .
% 0.19/0.46  7[0:Inp] ||  -> subset(u,v) in(skf3(v,u),u)*.
% 0.19/0.46  8[0:Inp] || in(skf3(u,v),u)*+ -> subset(w,u)*.
% 0.19/0.46  10[0:Inp] || subset(u,v)* subset(v,w)* -> subset(u,w)*.
% 0.19/0.46  11[0:Inp] || in(u,v)* equal(v,powerset(w))*+ -> subset(u,w)*.
% 0.19/0.46  12[0:Inp] || subset(u,v)*+ equal(w,powerset(v))* -> in(u,w)*.
% 0.19/0.46  38[0:EqR:11.1] || in(u,powerset(v))* -> subset(u,v).
% 0.19/0.46  44[0:Res:7.1,38.0] ||  -> subset(powerset(u),v) subset(skf3(v,powerset(u)),u)*l.
% 0.19/0.46  48[0:NCh:10.2,10.1,12.0,2.0] || subset(u,skc4) equal(v,powerset(skc5)) -> in(u,v)*.
% 0.19/0.46  117[0:Res:48.2,8.0] || subset(skf3(u,v),skc4)*l+ equal(u,powerset(skc5)) -> subset(w,u)*.
% 0.19/0.46  222[0:Res:44.1,117.0] || equal(u,powerset(skc5))* -> subset(powerset(skc4),u) subset(v,u)*.
% 0.19/0.46  225[0:Con:222.2] || equal(u,powerset(skc5))* -> subset(powerset(skc4),u).
% 0.19/0.46  228[0:EqR:225.0] ||  -> subset(powerset(skc4),powerset(skc5))*r.
% 0.19/0.46  229[0:MRR:228.0,5.0] ||  -> .
% 0.19/0.46  % SZS output end Refutation
% 0.19/0.46  Formulae used in the proof : t79_zfmisc_1 d3_tarski t1_xboole_1 d1_zfmisc_1
% 0.19/0.46  
%------------------------------------------------------------------------------