TSTP Solution File: COM002_1 by SPASS+T---2.2.22
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : COM002_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% Computer : n032.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:45:00 EDT 2022
% Result : Theorem 0.61s 0.88s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 32 ( 15 unt; 0 nHn; 32 RR)
% Number of literals : 85 ( 0 equ; 61 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
label(loop),
file('COM002_1.p',unknown),
[] ).
cnf(9,axiom,
state(p8),
file('COM002_1.p',unknown),
[] ).
cnf(10,axiom,
state(p7),
file('COM002_1.p',unknown),
[] ).
cnf(11,axiom,
state(p6),
file('COM002_1.p',unknown),
[] ).
cnf(14,axiom,
state(p3),
file('COM002_1.p',unknown),
[] ).
cnf(23,axiom,
follows(p8,p7),
file('COM002_1.p',unknown),
[] ).
cnf(24,axiom,
follows(p7,p6),
file('COM002_1.p',unknown),
[] ).
cnf(25,axiom,
follows(p6,p3),
file('COM002_1.p',unknown),
[] ).
cnf(28,axiom,
labels(loop,p3),
file('COM002_1.p',unknown),
[] ).
cnf(30,axiom,
has(p8,goto(loop)),
file('COM002_1.p',unknown),
[] ).
cnf(32,axiom,
~ succeeds(p3,p3),
file('COM002_1.p',unknown),
[] ).
cnf(44,axiom,
( ~ state(U)
| ~ state(V)
| ~ follows(V,U)
| succeeds(V,U) ),
file('COM002_1.p',unknown),
[] ).
cnf(46,axiom,
( ~ state(U)
| ~ state(V)
| ~ state(W)
| ~ succeeds(V,U)
| ~ succeeds(W,V)
| succeeds(W,U) ),
file('COM002_1.p',unknown),
[] ).
cnf(47,axiom,
( ~ state(U)
| ~ label(V)
| ~ state(W)
| ~ labels(V,U)
| ~ has(W,goto(V))
| succeeds(U,W) ),
file('COM002_1.p',unknown),
[] ).
cnf(105,plain,
( ~ state(U)
| ~ state(V)
| ~ follows(V,U)
| ~ state(U)
| ~ state(V)
| ~ state(W)
| ~ succeeds(W,V)
| succeeds(W,U) ),
inference(res,[status(thm),theory(equality)],[44,46]),
[iquote('0:Res:44.3,46.3')] ).
cnf(107,plain,
( ~ follows(U,V)
| ~ state(V)
| ~ state(U)
| ~ state(W)
| ~ succeeds(W,U)
| succeeds(W,V) ),
inference(obv,[status(thm),theory(equality)],[105]),
[iquote('0:Obv:105.1')] ).
cnf(122,plain,
( ~ state(U)
| ~ label(loop)
| ~ state(p8)
| ~ labels(loop,U)
| succeeds(U,p8) ),
inference(res,[status(thm),theory(equality)],[30,47]),
[iquote('0:Res:30.0,47.4')] ).
cnf(124,plain,
( ~ state(U)
| ~ labels(loop,U)
| succeeds(U,p8) ),
inference(mrr,[status(thm)],[122,1,9]),
[iquote('0:MRR:122.1,122.2,1.0,9.0')] ).
cnf(141,plain,
( ~ state(p3)
| ~ state(p6)
| ~ state(U)
| ~ succeeds(U,p6)
| succeeds(U,p3) ),
inference(res,[status(thm),theory(equality)],[25,107]),
[iquote('0:Res:25.0,107.0')] ).
cnf(142,plain,
( ~ state(p6)
| ~ state(p7)
| ~ state(U)
| ~ succeeds(U,p7)
| succeeds(U,p6) ),
inference(res,[status(thm),theory(equality)],[24,107]),
[iquote('0:Res:24.0,107.0')] ).
cnf(143,plain,
( ~ state(p7)
| ~ state(p8)
| ~ state(U)
| ~ succeeds(U,p8)
| succeeds(U,p7) ),
inference(res,[status(thm),theory(equality)],[23,107]),
[iquote('0:Res:23.0,107.0')] ).
cnf(147,plain,
( ~ state(U)
| ~ succeeds(U,p6)
| succeeds(U,p3) ),
inference(mrr,[status(thm)],[141,14,11]),
[iquote('0:MRR:141.0,141.1,14.0,11.0')] ).
cnf(148,plain,
( ~ state(U)
| ~ succeeds(U,p7)
| succeeds(U,p6) ),
inference(mrr,[status(thm)],[142,11,10]),
[iquote('0:MRR:142.0,142.1,11.0,10.0')] ).
cnf(149,plain,
( ~ state(U)
| ~ succeeds(U,p8)
| succeeds(U,p7) ),
inference(mrr,[status(thm)],[143,10,9]),
[iquote('0:MRR:143.0,143.1,10.0,9.0')] ).
cnf(171,plain,
( ~ state(p3)
| ~ succeeds(p3,p6) ),
inference(res,[status(thm),theory(equality)],[147,32]),
[iquote('0:Res:147.2,32.0')] ).
cnf(175,plain,
~ succeeds(p3,p6),
inference(mrr,[status(thm)],[171,14]),
[iquote('0:MRR:171.0,14.0')] ).
cnf(184,plain,
( ~ state(p3)
| ~ succeeds(p3,p7) ),
inference(res,[status(thm),theory(equality)],[148,175]),
[iquote('0:Res:148.2,175.0')] ).
cnf(185,plain,
~ succeeds(p3,p7),
inference(mrr,[status(thm)],[184,14]),
[iquote('0:MRR:184.0,14.0')] ).
cnf(192,plain,
( ~ state(p3)
| ~ succeeds(p3,p8) ),
inference(res,[status(thm),theory(equality)],[149,185]),
[iquote('0:Res:149.2,185.0')] ).
cnf(193,plain,
~ succeeds(p3,p8),
inference(mrr,[status(thm)],[192,14]),
[iquote('0:MRR:192.0,14.0')] ).
cnf(197,plain,
( ~ state(p3)
| ~ labels(loop,p3) ),
inference(res,[status(thm),theory(equality)],[124,193]),
[iquote('0:Res:124.2,193.0')] ).
cnf(198,plain,
$false,
inference(mrr,[status(thm)],[197,14,28]),
[iquote('0:MRR:197.0,197.1,14.0,28.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : COM002_1 : TPTP v8.1.0. Released v5.0.0.
% 0.00/0.09 % Command : spasst-tptp-script %s %d
% 0.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 600
% 0.09/0.27 % DateTime : Thu Jun 16 18:02:00 EDT 2022
% 0.13/0.27 % CPUTime :
% 0.13/0.37 % Using EUF theory
% 0.61/0.88
% 0.61/0.88
% 0.61/0.88 % SZS status Theorem for /tmp/SPASST_17971_n032.cluster.edu
% 0.61/0.88
% 0.61/0.88 SPASS V 2.2.22 in combination with yices.
% 0.61/0.88 SPASS beiseite: Proof found by SPASS.
% 0.61/0.88 Problem: /tmp/SPASST_17971_n032.cluster.edu
% 0.61/0.88 SPASS derived 57 clauses, backtracked 0 clauses and kept 95 clauses.
% 0.61/0.88 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.61/0.88 SPASS allocated 6436 KBytes.
% 0.61/0.88 SPASS spent 0:00:00.02 on the problem.
% 0.61/0.88 0:00:00.00 for the input.
% 0.61/0.88 0:00:00.01 for the FLOTTER CNF translation.
% 0.61/0.88 0:00:00.00 for inferences.
% 0.61/0.88 0:00:00.00 for the backtracking.
% 0.61/0.88 0:00:00.00 for the reduction.
% 0.61/0.88 0:00:00.00 for interacting with the SMT procedure.
% 0.61/0.88
% 0.61/0.88
% 0.61/0.88 % SZS output start CNFRefutation for /tmp/SPASST_17971_n032.cluster.edu
% See solution above
% 0.61/0.88
% 0.61/0.88 Formulae used in the proof : fof_loop_type fof_p8_type fof_p7_type fof_p6_type fof_p3_type fof_transition_7_to_8 fof_transition_6_to_7 fof_transition_3_to_6 fof_label_state_3 fof_state_8 fof_prove_there_is_a_loop_through_p3 fof_direct_success fof_transitivity_of_success fof_goto_success
% 0.61/0.90
% 0.61/0.90 SPASS+T ended
%------------------------------------------------------------------------------