TSTP Solution File: COM002-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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 : Fri Jul 15 01:44:10 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 18:09:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 23 clauses, backtracked 0 clauses, performed 0 splits and kept 41 clauses.
% 0.19/0.42 SPASS allocated 63112 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.42 0:00:00.04 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.00 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 4, length 18 :
% 0.19/0.42 % SZS output start Refutation
% 0.19/0.42 1[0:Inp] || follows(u,v)* -> succeeds(u,v).
% 0.19/0.42 2[0:Inp] || succeeds(u,v)* succeeds(v,w)* -> succeeds(u,w)*.
% 0.19/0.42 3[0:Inp] || labels(u,v)* has(w,goto(u))*+ -> succeeds(v,w)*.
% 0.19/0.42 8[0:Inp] || -> labels(loop,p3)*.
% 0.19/0.42 13[0:Inp] || -> follows(p6,p3)*.
% 0.19/0.42 15[0:Inp] || -> follows(p7,p6)*.
% 0.19/0.42 17[0:Inp] || -> follows(p8,p7)*.
% 0.19/0.42 18[0:Inp] || -> has(p8,goto(loop))*.
% 0.19/0.42 19[0:Inp] || succeeds(p3,p3)* -> .
% 0.19/0.42 23[0:Res:17.0,1.0] || -> succeeds(p8,p7)*r.
% 0.19/0.42 24[0:Res:15.0,1.0] || -> succeeds(p7,p6)*r.
% 0.19/0.42 25[0:Res:13.0,1.0] || -> succeeds(p6,p3)*r.
% 0.19/0.42 30[0:NCh:2.2,2.1,25.0,19.0] || succeeds(p3,p6)*l -> .
% 0.19/0.42 31[0:Res:18.0,3.1] || labels(loop,u)* -> succeeds(u,p8).
% 0.19/0.42 34[0:Res:8.0,31.0] || -> succeeds(p3,p8)*l.
% 0.19/0.42 37[0:NCh:2.2,2.0,34.0,30.0] || succeeds(p8,p6)*r -> .
% 0.19/0.42 42[0:NCh:2.2,2.1,37.0,24.0] || succeeds(p8,p7)*r -> .
% 0.19/0.42 43[0:MRR:42.0,23.0] || -> .
% 0.19/0.42 % SZS output end Refutation
% 0.19/0.42 Formulae used in the proof : direct_success transitivity_of_success goto_success label_state_3 transition_3_to_6 transition_6_to_7 transition_7_to_8 state_8 prove_there_is_a_loop_through_p3
% 0.19/0.42
%------------------------------------------------------------------------------