TSTP Solution File: SWV408+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV408+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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 : Wed Jul 20 21:42:41 EDT 2022
% Result : Theorem 0.35s 0.53s
% Output : Refutation 0.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV408+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n027.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 : Wed Jun 15 16:53:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.35/0.53
% 0.35/0.53 SPASS V 3.9
% 0.35/0.53 SPASS beiseite: Proof found.
% 0.35/0.53 % SZS status Theorem
% 0.35/0.53 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.53 SPASS derived 322 clauses, backtracked 19 clauses, performed 1 splits and kept 222 clauses.
% 0.35/0.53 SPASS allocated 85593 KBytes.
% 0.35/0.53 SPASS spent 0:00:00.17 on the problem.
% 0.35/0.53 0:00:00.04 for the input.
% 0.35/0.53 0:00:00.05 for the FLOTTER CNF translation.
% 0.35/0.53 0:00:00.01 for inferences.
% 0.35/0.53 0:00:00.00 for the backtracking.
% 0.35/0.53 0:00:00.04 for the reduction.
% 0.35/0.53
% 0.35/0.53
% 0.35/0.53 Here is a proof with depth 3, length 17 :
% 0.35/0.53 % SZS output start Refutation
% 0.35/0.53 1[0:Inp] || -> contains_slb(skc4,skc5)*.
% 0.35/0.53 11[0:Inp] || -> less_than(u,v)* less_than(v,u)*.
% 0.35/0.53 22[0:Inp] || pair_in_list(update_slb(skc4,findmin_pqp_res(skc6)),skc5,findmin_pqp_res(skc6))* -> .
% 0.35/0.53 27[0:Inp] || contains_slb(u,v) -> pair_in_list(u,v,skf1(v,u))*.
% 0.35/0.53 28[0:Inp] || less_than(u,v) -> less_than(v,u) strictly_less_than(u,v)*.
% 0.35/0.53 36[0:Inp] || less_than(findmin_pqp_res(skc6),u) pair_in_list(update_slb(skc4,findmin_pqp_res(skc6)),skc5,u)* -> .
% 0.35/0.53 41[0:Inp] || strictly_less_than(u,v)* pair_in_list(w,x,u)*+ -> pair_in_list(update_slb(w,v),x,v)*.
% 0.35/0.53 42[0:Inp] || less_than(u,v) pair_in_list(w,x,v) -> pair_in_list(update_slb(w,u),x,v)*.
% 0.35/0.53 62[0:MRR:28.0,11.0] || -> strictly_less_than(u,v)* less_than(v,u).
% 0.35/0.53 69[0:Res:1.0,27.0] || -> pair_in_list(skc4,skc5,skf1(skc5,skc4))*.
% 0.35/0.53 77[0:Res:41.2,22.0] || strictly_less_than(u,findmin_pqp_res(skc6)) pair_in_list(skc4,skc5,u)* -> .
% 0.35/0.53 92[0:Res:69.0,77.1] || strictly_less_than(skf1(skc5,skc4),findmin_pqp_res(skc6))* -> .
% 0.35/0.53 101[0:Res:62.0,92.0] || -> less_than(findmin_pqp_res(skc6),skf1(skc5,skc4))*r.
% 0.35/0.53 421[0:Res:42.2,36.1] || less_than(findmin_pqp_res(skc6),u) pair_in_list(skc4,skc5,u)* less_than(findmin_pqp_res(skc6),u) -> .
% 0.35/0.53 423[0:Obv:421.0] || pair_in_list(skc4,skc5,u)* less_than(findmin_pqp_res(skc6),u) -> .
% 0.35/0.53 424[0:Res:27.1,423.0] || contains_slb(skc4,skc5) less_than(findmin_pqp_res(skc6),skf1(skc5,skc4))*r -> .
% 0.35/0.53 427[0:MRR:424.0,424.1,1.0,101.0] || -> .
% 0.35/0.53 % SZS output end Refutation
% 0.35/0.53 Formulae used in the proof : l44_co totality l45_li4647 stricly_smaller_definition l48_li3839 l49_li3637
% 0.35/0.53
%------------------------------------------------------------------------------