%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN082+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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:39:08 PM UTC 2026
% Result : Theorem 1.48s 1.26s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 6 unt; 1 def)
% Number of atoms : 78 ( 1 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 83 ( 34 ~; 32 |; 12 &)
% ( 2 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 31 ( 0 sgn 21 !; 10 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( big_f(X0,f(X0))
<=> ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,X1)
=> big_f(X2,f(X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel60) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( big_f(X0,f(X0))
<=> ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( big_f(X2,X1)
=> big_f(X2,f(X0)) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0] :
( big_f(X0,f(X0))
<~> ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( ~ big_f(X2,X1)
| big_f(X2,f(X0)) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0] :
( ( big_f(X0,f(X0))
| ? [X1] :
( big_f(X0,X1)
& ! [X2] :
( ~ big_f(X2,X1)
| big_f(X2,f(X0)) ) ) )
& ( ~ big_f(X0,f(X0))
| ! [X1] :
( ~ big_f(X0,X1)
| ? [X2] :
( big_f(X2,X1)
& ~ big_f(X2,f(X0)) ) ) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0] :
( ( big_f(X0,f(X0))
| ? [X3] :
( big_f(X0,X3)
& ! [X4] :
( ~ big_f(X4,X3)
| big_f(X4,f(X0)) ) ) )
& ( ~ big_f(X0,f(X0))
| ! [X1] :
( ~ big_f(X0,X1)
| ? [X2] :
( big_f(X2,X1)
& ~ big_f(X2,f(X0)) ) ) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ( big_f(sK0,f(sK0))
| ( big_f(sK0,sK2)
& ! [X4] :
( ~ big_f(X4,sK2)
| big_f(X4,f(sK0)) ) ) )
& ( ~ big_f(sK0,f(sK0))
| ! [X1] :
( ~ big_f(sK0,X1)
| ( big_f(sK1(X1),X1)
& ~ big_f(sK1(X1),f(sK0)) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X2,sK1(X1)),skolemize(X3,sK2)],[f5]) ).
fof(f7,plain,
( big_f(sK0,f(sK0))
| big_f(sK0,sK2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X4] :
( big_f(sK0,f(sK0))
| ~ big_f(X4,sK2)
| big_f(X4,f(sK0)) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X1] :
( ~ big_f(sK0,f(sK0))
| ~ big_f(sK0,X1)
| big_f(sK1(X1),X1) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X1] :
( ~ big_f(sK0,f(sK0))
| ~ big_f(sK0,X1)
| ~ big_f(sK1(X1),f(sK0)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ big_f(sK0,X0)
| ~ big_f(sK0,f(sK0))
| ~ big_f(sK1(X0),f(sK0)) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( big_f(sK1(X0),X0)
| ~ big_f(sK0,X0)
| ~ big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( big_f(sK0,f(sK0))
| big_f(X0,f(sK0))
| ~ big_f(X0,sK2) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_52,negated_conjecture,
( big_f(sK0,sK2)
| big_f(sK0,f(sK0)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_53,plain,
( big_f(sK0,f(sK0))
| ~ big_f(sK0,sK2) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_56,negated_conjecture,
big_f(sK0,f(sK0)),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_53]) ).
tcf(c_58,negated_conjecture,
big_f(sK0,f(sK0)),
inference(global_subsumption_just,[status(thm)],[c_51,c_52,c_53]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] :
( big_f(sK1(X0),X0)
| ~ big_f(sK0,X0) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_50,c_56]) ).
tcf(c_63,negated_conjecture,
! [X0: $i] :
( ~ big_f(sK0,X0)
| ~ big_f(sK1(X0),f(sK0)) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_52,c_53,c_49]) ).
tcf(c_86,definition,
iPr_def_10 = f(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_87,negated_conjecture,
! [X0: $i] :
( ~ big_f(sK0,X0)
| ~ big_f(sK1(X0),iPr_def_10) ),
inference(demodulation,[status(thm)],[c_63,c_86]) ).
tcf(c_88,negated_conjecture,
! [X0: $i] :
( big_f(sK1(X0),X0)
| ~ big_f(sK0,X0) ),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_89,negated_conjecture,
big_f(sK0,iPr_def_10),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_171,plain,
~ big_f(sK0,iPr_def_10),
inference(superposition,[status(thm)],[c_88,c_87]) ).
tcf(c_172,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_171,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN082+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n020.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 00:08:33 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 1.48/1.26 % SZS status Started for theBenchmark.p
% 1.48/1.26 % SZS status Theorem for theBenchmark.p
% 1.48/1.26
% 1.48/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/1.26
% 1.48/1.26 % ------ iProver source info
% 1.48/1.26
% 1.48/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.48/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/1.26 % git: non_committed_changes: false
% 1.48/1.26
% 1.48/1.26 % ------ Parsing...
% 1.48/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.48/1.26
% 1.48/1.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.48/1.26
% 1.48/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.48/1.26
% 1.48/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.48/1.26 % ------ Proving...
% 1.48/1.26 % ------ Problem Properties
% 1.48/1.26
% 1.48/1.26 %
% 1.48/1.26 % clauses 4
% 1.48/1.26 % conjectures 3
% 1.48/1.26 % EPR 1
% 1.48/1.26 % Horn 4
% 1.48/1.26 % unary 2
% 1.48/1.26 % binary 2
% 1.48/1.26 % lits 6
% 1.48/1.26 % lits eq 1
% 1.48/1.26 % fd_pure 0
% 1.48/1.26 % fd_pseudo 0
% 1.48/1.26 % fd_cond 0
% 1.48/1.26 % fd_pseudo_cond 0
% 1.48/1.26 % AC symbols 0
% 1.48/1.26
% 1.48/1.26 % ------ Schedule dynamic 5 is on
% 1.48/1.26
% 1.48/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.48/1.26
% 1.48/1.26
% 1.48/1.26 % ------
% 1.48/1.26 % Current options:
% 1.48/1.26 % ------
% 1.48/1.26
% 1.48/1.26
% 1.48/1.26 %
% 1.48/1.26
% 1.48/1.26 % ------ Proving...
% 1.48/1.26 %
% 1.48/1.26
% 1.48/1.26 % SZS status Theorem for theBenchmark.p
% 1.48/1.26
% 1.48/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/1.26
% 1.48/1.26
%------------------------------------------------------------------------------