TSTP Solution File: SYO607+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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 : Thu Jul 21 19:55:03 EDT 2022
% Result : Theorem 0.21s 0.45s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% 0.13/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 8 20:00:53 EDT 2022
% 0.21/0.35 % CPUTime :
% 0.21/0.45
% 0.21/0.45 SPASS V 3.9
% 0.21/0.45 SPASS beiseite: Proof found.
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 SPASS derived 59 clauses, backtracked 10 clauses, performed 2 splits and kept 58 clauses.
% 0.21/0.45 SPASS allocated 85215 KBytes.
% 0.21/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.45 0:00:00.04 for the input.
% 0.21/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.45 0:00:00.00 for inferences.
% 0.21/0.45 0:00:00.00 for the backtracking.
% 0.21/0.45 0:00:00.00 for the reduction.
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Here is a proof with depth 5, length 43 :
% 0.21/0.45 % SZS output start Refutation
% 0.21/0.45 1[0:Inp] || g_true_only(u,skf3(u))* -> .
% 0.21/0.45 4[0:Inp] || g_both(u,v) -> g_false(u,v)*.
% 0.21/0.45 6[0:Inp] || g_false_only(u,v)*+ g_false_only(a,u)* -> .
% 0.21/0.45 7[0:Inp] || g_true_only(u,v) g_false(u,v)* -> .
% 0.21/0.45 9[0:Inp] || -> g_false_only(u,v) g_both(u,v)* g_true_only(u,v).
% 0.21/0.45 12[0:Inp] || g_both(a,u)* -> g_true_only(a,u) g_true_only(u,v)* SkC0.
% 0.21/0.45 14[0:Inp] || g_both(u,v)* -> g_false_only(u,skf5(u))* g_true_only(a,u) g_true_only(u,w)* SkC0.
% 0.21/0.45 15[0:Inp] || SkC0 g_both(u,v)* -> g_false_only(a,skc3) g_false_only(u,skf4(u))* g_true_only(skc5,w)*.
% 0.21/0.45 16[0:Inp] || SkC0 g_both(u,v)* -> g_false_only(skc3,skc4) g_false_only(u,skf4(u))* g_true_only(skc5,w)*.
% 0.21/0.45 17[0:Res:12.2,1.0] || g_both(a,u)* -> SkC0 g_true_only(a,u).
% 0.21/0.45 19[0:Res:9.0,1.0] || -> g_false_only(u,skf3(u)) g_both(u,skf3(u))*.
% 0.21/0.45 20[0:Res:14.3,1.0] || g_both(u,v)*+ -> SkC0 g_false_only(u,skf5(u))* g_true_only(a,u).
% 0.21/0.45 23[0:Res:15.4,1.0] || SkC0 g_both(u,v)* -> g_false_only(u,skf4(u))* g_false_only(a,skc3).
% 0.21/0.45 24[0:Res:16.4,1.0] || SkC0 g_both(u,v)* -> g_false_only(u,skf4(u))* g_false_only(skc3,skc4).
% 0.21/0.45 34[1:Spt:20.1] || -> SkC0*.
% 0.21/0.45 35[1:MRR:24.0,34.0] || g_both(u,v)*+ -> g_false_only(u,skf4(u))* g_false_only(skc3,skc4).
% 0.21/0.45 36[1:MRR:23.0,34.0] || g_both(u,v)* -> g_false_only(u,skf4(u))* g_false_only(a,skc3).
% 0.21/0.45 38[0:Res:4.1,7.1] || g_both(u,v)* g_true_only(u,v) -> .
% 0.21/0.45 51[2:Spt:35.0,35.1] || g_both(u,v)*+ -> g_false_only(u,skf4(u))*.
% 0.21/0.45 53[2:Res:19.1,51.0] || -> g_false_only(u,skf3(u))* g_false_only(u,skf4(u)).
% 0.21/0.45 54[2:Res:53.0,6.0] || g_false_only(a,u) -> g_false_only(u,skf4(u))*.
% 0.21/0.45 55[2:MRR:54.1,6.0] || g_false_only(a,u)* -> .
% 0.21/0.45 56[2:Res:53.0,55.0] || -> g_false_only(a,skf4(a))*.
% 0.21/0.45 57[2:MRR:56.0,55.0] || -> .
% 0.21/0.45 58[2:Spt:57.0,35.2] || -> g_false_only(skc3,skc4)*.
% 0.21/0.45 59[2:Res:58.0,6.0] || g_false_only(a,skc3)* -> .
% 0.21/0.45 60[2:MRR:36.2,59.0] || g_both(u,v)*+ -> g_false_only(u,skf4(u))*.
% 0.21/0.45 62[2:Res:19.1,60.0] || -> g_false_only(u,skf3(u))* g_false_only(u,skf4(u)).
% 0.21/0.45 63[2:Res:62.0,6.0] || g_false_only(a,u) -> g_false_only(u,skf4(u))*.
% 0.21/0.45 64[2:MRR:63.1,6.0] || g_false_only(a,u)* -> .
% 0.21/0.45 65[2:Res:62.0,64.0] || -> g_false_only(a,skf4(a))*.
% 0.21/0.45 66[2:MRR:65.0,64.0] || -> .
% 0.21/0.45 67[1:Spt:66.0,20.1,34.0] || SkC0* -> .
% 0.21/0.45 68[1:Spt:66.0,20.0,20.2,20.3] || g_both(u,v)*+ -> g_false_only(u,skf5(u))* g_true_only(a,u).
% 0.21/0.45 70[0:MRR:17.2,38.1] || g_both(a,u)* -> SkC0.
% 0.21/0.45 71[1:MRR:70.1,67.0] || g_both(a,u)* -> .
% 0.21/0.45 73[1:Res:19.1,68.0] || -> g_false_only(u,skf3(u))* g_false_only(u,skf5(u)) g_true_only(a,u).
% 0.21/0.45 74[1:Res:9.1,71.0] || -> g_false_only(a,u) g_true_only(a,u)*.
% 0.21/0.45 89[1:Res:73.0,6.0] || g_false_only(a,u) -> g_false_only(u,skf5(u))* g_true_only(a,u).
% 0.21/0.45 90[1:MRR:89.0,74.0] || -> g_false_only(u,skf5(u))* g_true_only(a,u).
% 0.21/0.45 91[1:Res:90.0,6.0] || g_false_only(a,u) -> g_true_only(a,u)*.
% 0.21/0.45 92[1:MRR:91.0,74.0] || -> g_true_only(a,u)*.
% 0.21/0.45 93[1:UnC:92.0,1.0] || -> .
% 0.21/0.45 % SZS output end Refutation
% 0.21/0.45 Formulae used in the proof : nc6 both_g true_only_g exhaustion_g
% 0.21/0.45
%------------------------------------------------------------------------------