TSTP Solution File: NUN062+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.4.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 : Mon Jul 18 16:38:43 EDT 2022
% Result : Theorem 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.4.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n027.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 : Thu Jun 2 04:30:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 74 clauses, backtracked 0 clauses, performed 0 splits and kept 107 clauses.
% 0.18/0.45 SPASS allocated 97829 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.18/0.45 0:00:00.04 for the input.
% 0.18/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.00 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.00 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 3, length 21 :
% 0.18/0.45 % SZS output start Refutation
% 0.18/0.45 5[0:Inp] || -> id__dfg(u,skf20(u))*r.
% 0.18/0.45 14[0:Inp] || -> r3(u,v,skf27(v,u))*.
% 0.18/0.45 24[0:Inp] r1(u) || SkP4(u,v)* -> .
% 0.18/0.45 25[0:Inp] || -> r2(skf27(u,v),skf24(v,u))*.
% 0.18/0.45 36[0:Inp] || id__dfg(u,v) -> r1(u) SkP4(v,u)*.
% 0.18/0.45 41[0:Inp] || r2(u,v) SkP5(w,x,v,u)* -> .
% 0.18/0.45 44[0:Inp] r1(u) || r2(v,w)* id__dfg(u,w)* -> .
% 0.18/0.45 45[0:Inp] || id__dfg(u,v)* r3(skc2,w,u)* -> r1(skf20(w)).
% 0.18/0.45 56[0:Inp] || id__dfg(u,v) id__dfg(w,x) -> r2(x,v) SkP5(v,x,u,w)*.
% 0.18/0.45 70[0:Res:5.0,44.1] r1(u) || r2(v,skf20(u))* -> .
% 0.18/0.45 71[0:Res:5.0,36.0] || -> r1(u) SkP4(skf20(u),u)*.
% 0.18/0.45 77[0:Res:5.0,56.1] || id__dfg(u,v) -> r2(v,skf20(w)) SkP5(skf20(w),v,w,u)*.
% 0.18/0.45 91[0:Res:14.0,45.1] || id__dfg(skf27(u,skc2),v)* -> r1(skf20(u)).
% 0.18/0.45 105[0:Res:5.0,77.0] || -> r2(skf20(u),skf20(v)) SkP5(skf20(v),skf20(u),v,u)*.
% 0.18/0.45 121[0:Res:5.0,91.0] || -> r1(skf20(u))*.
% 0.18/0.45 133[0:Res:71.1,24.1] r1(skf20(u)) || -> r1(u)*.
% 0.18/0.45 134[0:SSi:133.0,121.0] || -> r1(u)*.
% 0.18/0.45 138[0:MRR:70.0,134.0] || r2(u,skf20(v))* -> .
% 0.18/0.45 141[0:MRR:105.0,138.0] || -> SkP5(skf20(u),skf20(v),u,v)*.
% 0.18/0.45 147[0:Res:141.0,41.1] || r2(u,v)* -> .
% 0.18/0.45 148[0:UnC:147.0,25.0] || -> .
% 0.18/0.45 % SZS output end Refutation
% 0.18/0.45 Formulae used in the proof : infiniteNumbersid axiom_5 axiom_6 axiom_1a axiom_8 axiom_9 axiom_7a
% 0.18/0.45
%------------------------------------------------------------------------------