%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN986+1.002 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:45:35 PM UTC 2026
% Result : Theorem 1.58s 1.26s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 11 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 90 ( 46 ~; 38 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 54 ( 0 sgn 48 !; 6 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : r(X0,zero,succ(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp1) ).
fof(f2,axiom,
! [X0,X1,X2,X3] :
( r(X0,X1,X2)
=> ( r(X2,X1,X3)
=> r(X0,succ(X1),X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp2) ).
fof(f3,conjecture,
? [X0,X1,X2] :
( r(zero,X1,X2)
& r(zero,X0,X1)
& r(zero,zero,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ck) ).
fof(f4,negated_conjecture,
~ ? [X0,X1,X2] :
( r(zero,X1,X2)
& r(zero,X0,X1)
& r(zero,zero,X0) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
fof(f5,plain,
! [X0,X1,X2,X3] :
( ~ r(X0,X1,X2)
| ~ r(X2,X1,X3)
| r(X0,succ(X1),X3) ),
inference(ennf_transformation,[],[f2]) ).
fof(f6,plain,
! [X0,X1,X2,X3] :
( ~ r(X0,X1,X2)
| ~ r(X2,X1,X3)
| r(X0,succ(X1),X3) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ~ r(zero,X1,X2)
| ~ r(zero,X0,X1)
| ~ r(zero,zero,X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
! [X0] : r(X0,zero,succ(X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f9,plain,
! [X2,X3,X0,X1] :
( ~ r(X0,X1,X2)
| ~ r(X2,X1,X3)
| r(X0,succ(X1),X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X0,X1] :
( ~ r(zero,X1,X2)
| ~ r(zero,X0,X1)
| ~ r(zero,zero,X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,plain,
! [X0: $i] : r(X0,zero,succ(X0)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( r(X0,succ(X1),X3)
| ~ r(X2,X1,X3)
| ~ r(X0,X1,X2) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ r(zero,zero,X0)
| ~ r(zero,X1,X2)
| ~ r(zero,X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_52,plain,
r(zero,zero,succ(zero)),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_68,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ r(zero,zero,X0)
| ~ r(zero,X1,X2)
| ~ r(zero,X0,X1) ),
inference(demodulation,[status(thm)],[c_51]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] :
( ~ r(zero,X0,X1)
| ~ r(zero,zero,succ(zero))
| ~ r(zero,succ(zero),X0) ),
inference(instantiation,[status(thm)],[c_68]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( r(X0,succ(zero),X1)
| ~ r(X0,zero,succ(X0))
| ~ r(succ(X0),zero,X1) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_75,plain,
! [X0: $i] :
( r(X0,succ(zero),succ(succ(X0)))
| ~ r(X0,zero,succ(X0))
| ~ r(succ(X0),zero,succ(succ(X0))) ),
inference(instantiation,[status(thm)],[c_71]) ).
tcf(c_76,plain,
! [X0: $i] : r(succ(X0),zero,succ(succ(X0))),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_77,plain,
( r(zero,succ(zero),succ(succ(zero)))
| ~ r(zero,zero,succ(zero))
| ~ r(succ(zero),zero,succ(succ(zero))) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_78,plain,
r(succ(zero),zero,succ(succ(zero))),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( r(X0,succ(succ(zero)),X1)
| ~ r(X0,succ(zero),succ(succ(X0)))
| ~ r(succ(succ(X0)),succ(zero),X1) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_84,plain,
! [X0: $i] :
( ~ r(zero,zero,succ(zero))
| ~ r(zero,succ(succ(zero)),X0)
| ~ r(zero,succ(zero),succ(succ(zero))) ),
inference(instantiation,[status(thm)],[c_70]) ).
tcf(c_88,plain,
! [X0: $i] :
( r(X0,succ(succ(zero)),succ(succ(succ(succ(X0)))))
| ~ r(X0,succ(zero),succ(succ(X0)))
| ~ r(succ(succ(X0)),succ(zero),succ(succ(succ(succ(X0))))) ),
inference(instantiation,[status(thm)],[c_81]) ).
tcf(c_89,plain,
! [X0: $i] :
( r(succ(succ(X0)),succ(zero),succ(succ(succ(succ(X0)))))
| ~ r(succ(succ(X0)),zero,succ(succ(succ(X0))))
| ~ r(succ(succ(succ(X0))),zero,succ(succ(succ(succ(X0))))) ),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_90,plain,
( r(zero,succ(succ(zero)),succ(succ(succ(succ(zero)))))
| ~ r(zero,succ(zero),succ(succ(zero)))
| ~ r(succ(succ(zero)),succ(zero),succ(succ(succ(succ(zero))))) ),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_91,plain,
( r(succ(succ(zero)),succ(zero),succ(succ(succ(succ(zero)))))
| ~ r(succ(succ(zero)),zero,succ(succ(succ(zero))))
| ~ r(succ(succ(succ(zero))),zero,succ(succ(succ(succ(zero))))) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_95,plain,
( ~ r(zero,zero,succ(zero))
| ~ r(zero,succ(zero),succ(succ(zero)))
| ~ r(zero,succ(succ(zero)),succ(succ(succ(succ(zero))))) ),
inference(instantiation,[status(thm)],[c_84]) ).
tcf(c_115,plain,
! [X0: $i] : r(succ(succ(X0)),zero,succ(succ(succ(X0)))),
inference(instantiation,[status(thm)],[c_76]) ).
tcf(c_116,plain,
r(succ(succ(zero)),zero,succ(succ(succ(zero)))),
inference(instantiation,[status(thm)],[c_115]) ).
tcf(c_121,plain,
! [X0: $i] : r(succ(succ(succ(X0))),zero,succ(succ(succ(succ(X0))))),
inference(instantiation,[status(thm)],[c_115]) ).
tcf(c_122,plain,
r(succ(succ(succ(zero))),zero,succ(succ(succ(succ(zero))))),
inference(instantiation,[status(thm)],[c_121]) ).
tcf(c_123,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_122,c_116,c_95,c_91,c_90,c_78,c_77,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN986+1.002 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n004.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 25 02:43:55 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 1.58/1.26 % SZS status Started for theBenchmark.p
% 1.58/1.26 % SZS status Theorem for theBenchmark.p
% 1.58/1.26
% 1.58/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.58/1.26
% 1.58/1.26 % ------ iProver source info
% 1.58/1.26
% 1.58/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.58/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.58/1.26 % git: non_committed_changes: false
% 1.58/1.26
% 1.58/1.26 % ------ Parsing...
% 1.58/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.58/1.26
% 1.58/1.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.58/1.26
% 1.58/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.58/1.26 % ------ Proving...
% 1.58/1.26 % ------ Problem Properties
% 1.58/1.26
% 1.58/1.26 %
% 1.58/1.26 % clauses 3
% 1.58/1.26 % conjectures 1
% 1.58/1.26 % EPR 1
% 1.58/1.26 % Horn 3
% 1.58/1.26 % unary 1
% 1.58/1.26 % binary 0
% 1.58/1.26 % lits 7
% 1.58/1.26 % lits eq 0
% 1.58/1.26 % fd_pure 0
% 1.58/1.26 % fd_pseudo 0
% 1.58/1.26 % fd_cond 0
% 1.58/1.26 % fd_pseudo_cond 0
% 1.58/1.26 % AC symbols 0
% 1.58/1.26
% 1.58/1.26 % ------ Schedule dynamic 5 is on
% 1.58/1.26
% 1.58/1.26 % ------ no equalities: superposition off
% 1.58/1.26
% 1.58/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.58/1.26
% 1.58/1.26
% 1.58/1.26 % ------
% 1.58/1.26 % Current options:
% 1.58/1.26 % ------
% 1.58/1.26
% 1.58/1.26
% 1.58/1.26 %
% 1.58/1.26
% 1.58/1.26 % ------ Proving...
% 1.58/1.26 %
% 1.58/1.26
% 1.58/1.26 % SZS status Theorem for theBenchmark.p
% 1.58/1.26
% 1.58/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.58/1.26
% 1.58/1.26
%------------------------------------------------------------------------------