%------------------------------------------------------------------------------
% File : SPASS+T---2.2.22
% Problem : COM001_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : spasst-tptp-script %s %d
% 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 : Fri Jul 15 01:44:59 EDT 2022
% Result : Theorem 0.77s 1.05s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 20 ( 8 unt; 0 nHn; 20 RR)
% Number of literals : 60 ( 0 equ; 48 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
label(loop),
file('COM001_1.p',unknown),
[] ).
cnf(5,axiom,
state(p8),
file('COM001_1.p',unknown),
[] ).
cnf(8,axiom,
state(p3),
file('COM001_1.p',unknown),
[] ).
cnf(15,axiom,
follows(p8,p3),
file('COM001_1.p',unknown),
[] ).
cnf(17,axiom,
labels(loop,p3),
file('COM001_1.p',unknown),
[] ).
cnf(18,axiom,
has(p8,goto(loop)),
file('COM001_1.p',unknown),
[] ).
cnf(20,axiom,
~ succeeds(p3,p3),
file('COM001_1.p',unknown),
[] ).
cnf(25,axiom,
( ~ state(U)
| ~ state(V)
| ~ follows(V,U)
| succeeds(V,U) ),
file('COM001_1.p',unknown),
[] ).
cnf(27,axiom,
( ~ state(U)
| ~ state(V)
| ~ state(W)
| ~ succeeds(V,U)
| ~ succeeds(W,V)
| succeeds(W,U) ),
file('COM001_1.p',unknown),
[] ).
cnf(28,axiom,
( ~ state(U)
| ~ label(V)
| ~ state(W)
| ~ labels(V,U)
| ~ has(W,goto(V))
| succeeds(U,W) ),
file('COM001_1.p',unknown),
[] ).
cnf(32,plain,
( ~ state(p3)
| ~ state(U)
| ~ succeeds(p3,U)
| ~ succeeds(U,p3)
| ~ state(p3) ),
inference(res,[status(thm),theory(equality)],[27,20]),
[iquote('0:Res:27.5,20.0')] ).
cnf(37,plain,
( ~ state(U)
| ~ succeeds(p3,U)
| ~ succeeds(U,p3)
| ~ state(p3) ),
inference(obv,[status(thm),theory(equality)],[32]),
[iquote('0:Obv:32.0')] ).
cnf(38,plain,
( ~ state(U)
| ~ succeeds(U,p3)
| ~ succeeds(p3,U) ),
inference(mrr,[status(thm)],[37,8]),
[iquote('0:MRR:37.3,8.0')] ).
cnf(59,plain,
( ~ state(p3)
| ~ state(U)
| ~ follows(U,p3)
| ~ state(U)
| ~ succeeds(p3,U) ),
inference(res,[status(thm),theory(equality)],[25,38]),
[iquote('0:Res:25.3,38.1')] ).
cnf(61,plain,
( ~ state(p3)
| ~ follows(U,p3)
| ~ state(U)
| ~ succeeds(p3,U) ),
inference(obv,[status(thm),theory(equality)],[59]),
[iquote('0:Obv:59.1')] ).
cnf(62,plain,
( ~ follows(U,p3)
| ~ state(U)
| ~ succeeds(p3,U) ),
inference(mrr,[status(thm)],[61,8]),
[iquote('0:MRR:61.0,8.0')] ).
cnf(90,plain,
( ~ state(U)
| ~ label(loop)
| ~ state(p8)
| ~ labels(loop,U)
| succeeds(U,p8) ),
inference(res,[status(thm),theory(equality)],[18,28]),
[iquote('0:Res:18.0,28.4')] ).
cnf(92,plain,
( ~ state(U)
| ~ labels(loop,U)
| succeeds(U,p8) ),
inference(mrr,[status(thm)],[90,1,5]),
[iquote('0:MRR:90.1,90.2,1.0,5.0')] ).
cnf(101,plain,
( ~ state(p3)
| ~ labels(loop,p3)
| ~ follows(p8,p3)
| ~ state(p8) ),
inference(res,[status(thm),theory(equality)],[92,62]),
[iquote('0:Res:92.2,62.2')] ).
cnf(103,plain,
$false,
inference(mrr,[status(thm)],[101,8,17,15,5]),
[iquote('0:MRR:101.0,101.1,101.2,101.3,8.0,17.0,15.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM001_1 : TPTP v8.1.0. Released v5.0.0.
% 0.03/0.13 % Command : spasst-tptp-script %s %d
% 0.12/0.34 % Computer : n008.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 17:36:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 % Using EUF theory
% 0.77/1.05
% 0.77/1.05
% 0.77/1.05 % SZS status Theorem for /tmp/SPASST_26500_n008.cluster.edu
% 0.77/1.05
% 0.77/1.05 SPASS V 2.2.22 in combination with yices.
% 0.77/1.05 SPASS beiseite: Proof found by SPASS.
% 0.77/1.05 Problem: /tmp/SPASST_26500_n008.cluster.edu
% 0.77/1.05 SPASS derived 26 clauses, backtracked 0 clauses and kept 50 clauses.
% 0.77/1.05 SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.77/1.05 SPASS allocated 6381 KBytes.
% 0.77/1.05 SPASS spent 0:00:00.01 on the problem.
% 0.77/1.05 0:00:00.00 for the input.
% 0.77/1.05 0:00:00.00 for the FLOTTER CNF translation.
% 0.77/1.05 0:00:00.00 for inferences.
% 0.77/1.05 0:00:00.00 for the backtracking.
% 0.77/1.05 0:00:00.00 for the reduction.
% 0.77/1.05 0:00:00.00 for interacting with the SMT procedure.
% 0.77/1.05
% 0.77/1.05
% 0.77/1.05 % SZS output start CNFRefutation for /tmp/SPASST_26500_n008.cluster.edu
% See solution above
% 0.77/1.05
% 0.77/1.05 Formulae used in the proof : fof_loop_type fof_p8_type fof_p3_type fof_transition_3_to_8 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.77/1.07
% 0.77/1.07 SPASS+T ended
%------------------------------------------------------------------------------