%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN980+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.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:34 PM UTC 2026
% Result : Theorem 1.04s 11.41s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 25 ~; 17 |; 12 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 0 sgn 32 !; 8 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( ( q(f(X0),X0)
=> q(X2,X1) )
& p(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( ( q(f(X0),X0)
=> q(X2,X1) )
& p(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X3] :
( ( q(f(X0),X0)
=> q(X2,X3) )
& p(X2,X3) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
? [X0] :
( ! [X1] :
( ( r(X0)
& ~ r(X1) )
| p(f(X1),X1) )
& ! [X2,X3] :
( ( q(f(X0),X0)
& ~ q(X2,X3) )
| ~ p(X2,X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
? [X0] :
( ! [X3] :
( ( r(X0)
& ~ r(X3) )
| p(f(X3),X3) )
& ! [X1,X2] :
( ( q(f(X0),X0)
& ~ q(X1,X2) )
| ~ p(X1,X2) ) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
( ! [X3] :
( ( r(sK0)
& ~ r(X3) )
| p(f(X3),X3) )
& ! [X1,X2] :
( ( q(f(sK0),sK0)
& ~ q(X1,X2) )
| ~ p(X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f5]) ).
fof(f7,plain,
! [X3] :
( r(sK0)
| p(f(X3),X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f8,plain,
! [X3] :
( ~ r(X3)
| p(f(X3),X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f9,plain,
! [X2,X1] :
( q(f(sK0),sK0)
| ~ p(X1,X2) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X1] :
( ~ q(X1,X2)
| ~ p(X1,X2) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ q(X0,X1)
| ~ p(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( q(f(sK0),sK0)
| ~ p(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( p(f(X0),X0)
| ~ r(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( r(sK0)
| p(f(X0),X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_53,plain,
( r(sK0)
| p(f(sK0),sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_54,plain,
( p(f(sK0),sK0)
| ~ r(sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( ~ p(X0,X1)
| ~ p(f(sK0),sK0) ),
inference(resolution,[status(thm)],[c_49,c_50]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] : ~ p(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_73,c_53,c_54,c_73]) ).
tcf(c_82,plain,
! [X0: $i] : ~ r(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_75]) ).
tcf(c_83,plain,
r(sK0),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_75]) ).
tcf(c_84,plain,
~ r(sK0),
inference(instantiation,[status(thm)],[c_82]) ).
tcf(c_85,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_84,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN980+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/10.60 % Computer : n010.cluster.edu
% 0.10/10.60 % Model : x86_64 x86_64
% 0.10/10.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.60 % Memory : 8046.5625MB
% 0.10/10.60 % OS : Linux 6.8.0-71-generic
% 0.10/10.60 % CPULimit : 300
% 0.10/10.60 % WCLimit : 300
% 0.10/10.60 % DateTime : Fri Sep 25 02:42:42 UTC 2026
% 0.10/10.61 % CPUTime :
% 0.10/10.61 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/10.64 Running first-order theorem proving
% 0.10/10.65 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.10/10.66
% 0.10/10.66 % ======== iProver multi-core TPTP/SMT =========
% 0.10/10.66
% 0.10/10.66 % Detected problem language: tptp
% 0.10/10.67 % Proving...
% 1.04/11.41 % SZS status Started for theBenchmark.p
% 1.04/11.41 % SZS status Theorem for theBenchmark.p
% 1.04/11.41
% 1.04/11.41 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.04/11.41
% 1.04/11.41 % ------ iProver source info
% 1.04/11.41
% 1.04/11.41 % git: date: 2026-07-19 20:42:38 +0200
% 1.04/11.41 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.04/11.41 % git: non_committed_changes: false
% 1.04/11.41
% 1.04/11.41 % ------ Parsing...
% 1.04/11.41 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.04/11.41
% 1.04/11.41 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s%
% 1.04/11.41
% 1.04/11.41 % SZS status Theorem for theBenchmark.p
% 1.04/11.41
% 1.04/11.41 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.04/11.41
% 1.04/11.41
%------------------------------------------------------------------------------