TSTP Solution File: SYN986+1.001 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN986+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Fri Sep 1 03:15:04 EDT 2023
% Result : Theorem 1.22s 1.03s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 7 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 50 ( 26 ~; 19 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 2 sgn; 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r(X0,zero,succ(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp1) ).
fof(f2,axiom,
! [X0,X1,X2,X3] :
( r(X0,X1,X2)
=> ( r(X2,X1,X3)
=> r(X0,succ(X1),X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp2) ).
fof(f3,conjecture,
? [X3,X4] :
( r(zero,X3,X4)
& r(zero,zero,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ck) ).
fof(f4,negated_conjecture,
~ ? [X3,X4] :
( r(zero,X3,X4)
& r(zero,zero,X3) ),
inference(negated_conjecture,[],[f3]) ).
fof(f5,plain,
~ ? [X0,X1] :
( r(zero,X0,X1)
& r(zero,zero,X0) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
! [X0,X1,X2,X3] :
( r(X0,succ(X1),X3)
| ~ r(X2,X1,X3)
| ~ r(X0,X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0,X1,X2,X3] :
( r(X0,succ(X1),X3)
| ~ r(X2,X1,X3)
| ~ r(X0,X1,X2) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( ~ r(zero,X0,X1)
| ~ r(zero,zero,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f9,plain,
! [X0] : r(X0,zero,succ(X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f10,plain,
! [X2,X3,X0,X1] :
( r(X0,succ(X1),X3)
| ~ r(X2,X1,X3)
| ~ r(X0,X1,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X0,X1] :
( ~ r(zero,X0,X1)
| ~ r(zero,zero,X0) ),
inference(cnf_transformation,[],[f8]) ).
cnf(c_49,plain,
r(X0,zero,succ(X0)),
inference(cnf_transformation,[],[f9]) ).
cnf(c_50,plain,
( ~ r(X0,X1,X2)
| ~ r(X2,X1,X3)
| r(X0,succ(X1),X3) ),
inference(cnf_transformation,[],[f10]) ).
cnf(c_51,negated_conjecture,
( ~ r(zero,X0,X1)
| ~ r(zero,zero,X0) ),
inference(cnf_transformation,[],[f11]) ).
cnf(c_52,plain,
r(zero,zero,succ(zero)),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_67,plain,
( ~ r(zero,succ(zero),X0)
| ~ r(zero,zero,succ(zero)) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_69,plain,
( ~ r(succ(X0),zero,X1)
| ~ r(X0,zero,succ(X0))
| r(X0,succ(zero),X1) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_73,plain,
( ~ r(succ(X0),zero,succ(succ(X0)))
| ~ r(X0,zero,succ(X0))
| r(X0,succ(zero),succ(succ(X0))) ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_74,plain,
r(succ(X0),zero,succ(succ(X0))),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_75,plain,
( ~ r(succ(zero),zero,succ(succ(zero)))
| ~ r(zero,zero,succ(zero))
| r(zero,succ(zero),succ(succ(zero))) ),
inference(instantiation,[status(thm)],[c_73]) ).
cnf(c_76,plain,
r(succ(zero),zero,succ(succ(zero))),
inference(instantiation,[status(thm)],[c_74]) ).
cnf(c_82,plain,
( ~ r(zero,succ(zero),succ(succ(zero)))
| ~ r(zero,zero,succ(zero)) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_83,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_82,c_76,c_75,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN986+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sat Aug 26 19:39:29 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.22/1.03 % SZS status Started for theBenchmark.p
% 1.22/1.03 % SZS status Theorem for theBenchmark.p
% 1.22/1.03
% 1.22/1.03 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.22/1.03
% 1.22/1.03 ------ iProver source info
% 1.22/1.03
% 1.22/1.03 git: date: 2023-05-31 18:12:56 +0000
% 1.22/1.03 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.22/1.03 git: non_committed_changes: false
% 1.22/1.03 git: last_make_outside_of_git: false
% 1.22/1.03
% 1.22/1.03 ------ Parsing...
% 1.22/1.03 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.22/1.03
% 1.22/1.03 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.22/1.03
% 1.22/1.03 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.22/1.03 ------ Proving...
% 1.22/1.03 ------ Problem Properties
% 1.22/1.03
% 1.22/1.03
% 1.22/1.03 clauses 3
% 1.22/1.03 conjectures 1
% 1.22/1.03 EPR 1
% 1.22/1.03 Horn 3
% 1.22/1.03 unary 1
% 1.22/1.03 binary 1
% 1.22/1.03 lits 6
% 1.22/1.03 lits eq 0
% 1.22/1.03 fd_pure 0
% 1.22/1.03 fd_pseudo 0
% 1.22/1.03 fd_cond 0
% 1.22/1.03 fd_pseudo_cond 0
% 1.22/1.03 AC symbols 0
% 1.22/1.03
% 1.22/1.03 ------ Schedule dynamic 5 is on
% 1.22/1.03
% 1.22/1.03 ------ no equalities: superposition off
% 1.22/1.03
% 1.22/1.03 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.22/1.03
% 1.22/1.03
% 1.22/1.03 ------
% 1.22/1.03 Current options:
% 1.22/1.03 ------
% 1.22/1.03
% 1.22/1.03
% 1.22/1.03
% 1.22/1.03
% 1.22/1.03 ------ Proving...
% 1.22/1.03
% 1.22/1.03
% 1.22/1.03 % SZS status Theorem for theBenchmark.p
% 1.22/1.03
% 1.22/1.03 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.22/1.03
% 1.22/1.03
%------------------------------------------------------------------------------