TSTP Solution File: COM001-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : COM001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Wed Aug 30 18:41:37 EDT 2023
% Result : Unsatisfiable 0.48s 1.17s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ follows(X0,X1)
| succeeds(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
cnf(c_50,plain,
( ~ succeeds(X0,X1)
| ~ succeeds(X1,X2)
| succeeds(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
cnf(c_51,plain,
( ~ has(X0,goto(X1))
| ~ labels(X1,X2)
| succeeds(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
cnf(c_53,plain,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
cnf(c_57,plain,
follows(p8,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_8) ).
cnf(c_58,plain,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
cnf(c_59,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(c_101,plain,
succeeds(p8,p3),
inference(resolution,[status(thm)],[c_49,c_57]) ).
cnf(c_107,plain,
( ~ has(X0,goto(loop))
| succeeds(p3,X0) ),
inference(resolution,[status(thm)],[c_51,c_53]) ).
cnf(c_121,plain,
succeeds(p3,p8),
inference(resolution,[status(thm)],[c_58,c_107]) ).
cnf(c_147,plain,
( ~ succeeds(p8,X0)
| succeeds(p3,X0) ),
inference(resolution,[status(thm)],[c_50,c_121]) ).
cnf(c_148,plain,
( ~ succeeds(p8,p3)
| succeeds(p3,p3) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_149,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_148,c_101,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COM001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 12:58:55 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.17 % SZS status Started for theBenchmark.p
% 0.48/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.17
% 0.48/1.17 ------ iProver source info
% 0.48/1.17
% 0.48/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.17 git: non_committed_changes: false
% 0.48/1.17 git: last_make_outside_of_git: false
% 0.48/1.17
% 0.48/1.17 ------ Parsing...successful
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.17
% 0.48/1.17 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.48/1.17 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.17 ------ Proving...
% 0.48/1.17 ------ Problem Properties
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 clauses 6
% 0.48/1.17 conjectures 1
% 0.48/1.17 EPR 6
% 0.48/1.17 Horn 6
% 0.48/1.17 unary 5
% 0.48/1.17 binary 0
% 0.48/1.17 lits 8
% 0.48/1.17 lits eq 0
% 0.48/1.17 fd_pure 0
% 0.48/1.17 fd_pseudo 0
% 0.48/1.17 fd_cond 0
% 0.48/1.17 fd_pseudo_cond 0
% 0.48/1.17 AC symbols 0
% 0.48/1.17
% 0.48/1.17 ------ Schedule EPR Horn non eq is on
% 0.48/1.17
% 0.48/1.17 ------ no equalities: superposition off
% 0.48/1.17
% 0.48/1.17 ------ Option_epr_horn Time Limit: Unbounded
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------
% 0.48/1.17 Current options:
% 0.48/1.17 ------
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 ------ Proving...
% 0.48/1.17
% 0.48/1.17
% 0.48/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.17
% 0.48/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.17
% 0.48/1.17
%------------------------------------------------------------------------------