TSTP Solution File: NUN067+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUN067+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:44 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN067+1 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n025.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 Jun 2 08:11:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47
% 0.19/0.47 SPASS V 3.9
% 0.19/0.47 SPASS beiseite: Proof found.
% 0.19/0.47 % SZS status Theorem
% 0.19/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 SPASS derived 63 clauses, backtracked 0 clauses, performed 0 splits and kept 99 clauses.
% 0.19/0.47 SPASS allocated 97823 KBytes.
% 0.19/0.47 SPASS spent 0:00:00.11 on the problem.
% 0.19/0.47 0:00:00.04 for the input.
% 0.19/0.47 0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.47 0:00:00.00 for inferences.
% 0.19/0.47 0:00:00.00 for the backtracking.
% 0.19/0.47 0:00:00.00 for the reduction.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Here is a proof with depth 3, length 18 :
% 0.19/0.47 % SZS output start Refutation
% 0.19/0.47 1[0:Inp] || -> r1(skf20(u))*.
% 0.19/0.47 6[0:Inp] || -> id__dfg(u,skf20(u))*r.
% 0.19/0.47 25[0:Inp] r1(u) || SkP4(u,v)* -> .
% 0.19/0.47 26[0:Inp] || -> r2(skf27(u,v),skf24(v,u))*.
% 0.19/0.47 37[0:Inp] || id__dfg(u,v) -> r1(u) SkP4(v,u)*.
% 0.19/0.47 42[0:Inp] || r2(u,v) SkP5(w,x,v,u)* -> .
% 0.19/0.47 45[0:Inp] r1(u) || id__dfg(u,v)* r2(w,v)* -> .
% 0.19/0.47 56[0:Inp] || id__dfg(u,v) id__dfg(w,x) -> r2(v,x) SkP5(x,v,w,u)*.
% 0.19/0.47 63[0:Res:1.0,25.0] || SkP4(skf20(u),v)* -> .
% 0.19/0.47 73[0:Res:6.0,45.1] r1(u) || r2(v,skf20(u))* -> .
% 0.19/0.47 74[0:Res:6.0,37.0] || -> r1(u) SkP4(skf20(u),u)*.
% 0.19/0.47 80[0:Res:6.0,56.1] || id__dfg(u,v) -> r2(v,skf20(w)) SkP5(skf20(w),v,w,u)*.
% 0.19/0.47 86[0:MRR:74.1,63.0] || -> r1(u)*.
% 0.19/0.47 91[0:MRR:73.0,86.0] || r2(u,skf20(v))* -> .
% 0.19/0.47 94[0:MRR:80.1,91.0] || id__dfg(u,v) -> SkP5(skf20(w),v,w,u)*.
% 0.19/0.47 108[0:Res:6.0,94.0] || -> SkP5(skf20(u),skf20(v),u,v)*.
% 0.19/0.47 129[0:Res:108.0,42.1] || r2(u,v)* -> .
% 0.19/0.47 130[0:UnC:129.0,26.0] || -> .
% 0.19/0.47 % SZS output end Refutation
% 0.19/0.47 Formulae used in the proof : nonzerosexistid axiom_8 axiom_1a axiom_9 axiom_7a
% 0.19/0.47
%------------------------------------------------------------------------------