TSTP Solution File: NUM843+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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 : Mon Jul 18 14:30:59 EDT 2022
% Result : Theorem 0.42s 0.57s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM843+2 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n012.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 : Thu Jul 7 07:39:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/0.57
% 0.42/0.57 SPASS V 3.9
% 0.42/0.57 SPASS beiseite: Proof found.
% 0.42/0.57 % SZS status Theorem
% 0.42/0.57 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.57 SPASS derived 1043 clauses, backtracked 10 clauses, performed 1 splits and kept 605 clauses.
% 0.42/0.57 SPASS allocated 85961 KBytes.
% 0.42/0.57 SPASS spent 0:00:00.22 on the problem.
% 0.42/0.57 0:00:00.04 for the input.
% 0.42/0.57 0:00:00.03 for the FLOTTER CNF translation.
% 0.42/0.57 0:00:00.01 for inferences.
% 0.42/0.57 0:00:00.00 for the backtracking.
% 0.42/0.57 0:00:00.11 for the reduction.
% 0.42/0.57
% 0.42/0.57
% 0.42/0.57 Here is a proof with depth 3, length 14 :
% 0.42/0.57 % SZS output start Refutation
% 0.42/0.57 2[0:Inp] || greater(vd390,vd391)* -> .
% 0.42/0.57 3[0:Inp] || leq(vd390,vd391)*r -> .
% 0.42/0.57 18[0:Inp] || less(u,v)* -> leq(u,v).
% 0.42/0.57 19[0:Inp] || equal(u,v)* -> leq(u,v).
% 0.42/0.57 28[0:Inp] || -> less(u,v) greater(u,v)* equal(u,v).
% 0.42/0.57 59[0:Res:28.1,2.0] || -> less(vd390,vd391)*r equal(vd391,vd390).
% 0.42/0.57 63[1:Spt:59.1] || -> equal(vd391,vd390)**.
% 0.42/0.57 68[1:Rew:63.0,3.0] || leq(vd390,vd390)* -> .
% 0.42/0.57 560[0:EqR:19.0] || -> leq(u,u)*.
% 0.42/0.57 561[1:UnC:560.0,68.0] || -> .
% 0.42/0.57 562[1:Spt:561.0,59.1,63.0] || equal(vd391,vd390)** -> .
% 0.42/0.57 563[1:Spt:561.0,59.0] || -> less(vd390,vd391)*r.
% 0.42/0.57 1229[1:Res:563.0,18.0] || -> leq(vd390,vd391)*r.
% 0.42/0.57 1241[1:MRR:1229.0,3.0] || -> .
% 0.42/0.57 % SZS output end Refutation
% 0.42/0.57 Formulae used in the proof : holds_a40_244_a44__a32_394_a44__a32_0_a41_ holds_a40_conjunct2_a40_243_a41__a44__a32_393_a44__a32_0_a41_ def_a40_cond_a40_conseq_a40_axiom_a40_3_a41__a41__a44__a32_17_a41__a44__a32_1_a41_ ass_a40_cond_a40_goal_a40_130_a41__a44__a32_0_a41__a44__a32_0_a41_
% 0.42/0.57
%------------------------------------------------------------------------------