TSTP Solution File: COM002-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : COM002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:38 EDT 2023
% Result : Unsatisfiable 1.85s 1.15s
% Output : CNFRefutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 11 unt; 0 nHn; 21 RR)
% Number of literals : 33 ( 0 equ; 13 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 : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ follows(X0,X1)
| succeeds(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
cnf(c_50,plain,
( ~ succeeds(X0,X1)
| ~ succeeds(X1,X2)
| succeeds(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
cnf(c_51,plain,
( ~ has(X0,goto(X1))
| ~ labels(X1,X2)
| succeeds(X2,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
cnf(c_56,plain,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
cnf(c_61,plain,
follows(p6,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).
cnf(c_63,plain,
follows(p7,p6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).
cnf(c_65,plain,
follows(p8,p7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).
cnf(c_66,plain,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
cnf(c_67,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(c_121,plain,
( ~ has(X0,goto(loop))
| succeeds(p3,X0) ),
inference(resolution,[status(thm)],[c_51,c_56]) ).
cnf(c_143,plain,
succeeds(p6,p3),
inference(resolution,[status(thm)],[c_49,c_61]) ).
cnf(c_147,plain,
succeeds(p7,p6),
inference(resolution,[status(thm)],[c_49,c_63]) ).
cnf(c_151,plain,
succeeds(p8,p7),
inference(resolution,[status(thm)],[c_49,c_65]) ).
cnf(c_165,plain,
succeeds(p3,p8),
inference(resolution,[status(thm)],[c_66,c_121]) ).
cnf(c_202,plain,
( ~ succeeds(p6,X0)
| succeeds(p7,X0) ),
inference(resolution,[status(thm)],[c_50,c_147]) ).
cnf(c_203,plain,
( ~ succeeds(p6,p3)
| succeeds(p7,p3) ),
inference(instantiation,[status(thm)],[c_202]) ).
cnf(c_204,plain,
( ~ succeeds(p7,X0)
| succeeds(p8,X0) ),
inference(resolution,[status(thm)],[c_50,c_151]) ).
cnf(c_205,plain,
( ~ succeeds(p7,p3)
| succeeds(p8,p3) ),
inference(instantiation,[status(thm)],[c_204]) ).
cnf(c_207,plain,
( ~ succeeds(p8,X0)
| succeeds(p3,X0) ),
inference(resolution,[status(thm)],[c_50,c_165]) ).
cnf(c_208,plain,
( ~ succeeds(p8,p3)
| succeeds(p3,p3) ),
inference(instantiation,[status(thm)],[c_207]) ).
cnf(c_209,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_208,c_205,c_203,c_143,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 29 13:20:50 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.85/1.15 % SZS status Started for theBenchmark.p
% 1.85/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 1.85/1.15
% 1.85/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.85/1.15
% 1.85/1.15 ------ iProver source info
% 1.85/1.15
% 1.85/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.85/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.85/1.15 git: non_committed_changes: false
% 1.85/1.15 git: last_make_outside_of_git: false
% 1.85/1.15
% 1.85/1.15 ------ Parsing...successful
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15 ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.85/1.15
% 1.85/1.15 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.85/1.15 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.85/1.15 ------ Proving...
% 1.85/1.15 ------ Problem Properties
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15 clauses 10
% 1.85/1.15 conjectures 1
% 1.85/1.15 EPR 10
% 1.85/1.15 Horn 10
% 1.85/1.15 unary 9
% 1.85/1.15 binary 0
% 1.85/1.15 lits 12
% 1.85/1.15 lits eq 0
% 1.85/1.15 fd_pure 0
% 1.85/1.15 fd_pseudo 0
% 1.85/1.15 fd_cond 0
% 1.85/1.15 fd_pseudo_cond 0
% 1.85/1.15 AC symbols 0
% 1.85/1.15
% 1.85/1.15 ------ Schedule EPR Horn non eq is on
% 1.85/1.15
% 1.85/1.15 ------ no equalities: superposition off
% 1.85/1.15
% 1.85/1.15 ------ Option_epr_horn Time Limit: Unbounded
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15 ------
% 1.85/1.15 Current options:
% 1.85/1.15 ------
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15 ------ Proving...
% 1.85/1.15
% 1.85/1.15
% 1.85/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 1.85/1.15
% 1.85/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.85/1.16
% 1.85/1.16
%------------------------------------------------------------------------------