%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN941+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 : n019.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:28 PM UTC 2026
% Result : Theorem 1.73s 1.30s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 6 unt; 1 def)
% Number of atoms : 75 ( 1 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 88 ( 41 ~; 29 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn 27 !; 6 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0,X1] :
( q(f(X0))
& ! [X2,X3] :
( ~ q(X2)
| ( p(f(X3))
& ( ( r(X3)
& ( ~ r(X1)
| ~ r(X0) ) )
| ~ p(X2) ) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
( q(f(sK0))
& ! [X2,X3] :
( ~ q(X2)
| ( p(f(X3))
& ( ( r(X3)
& ( ~ r(sK1)
| ~ r(sK0) ) )
| ~ p(X2) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f3]) ).
fof(f5,plain,
q(f(sK0)),
inference(cnf_transformation,[],[f4]) ).
fof(f6,plain,
! [X2,X3] :
( ~ q(X2)
| p(f(X3)) ),
inference(cnf_transformation,[],[f4]) ).
fof(f7,plain,
! [X2,X3] :
( ~ q(X2)
| r(X3)
| ~ p(X2) ),
inference(cnf_transformation,[],[f4]) ).
fof(f8,plain,
! [X2] :
( ~ q(X2)
| ~ r(sK1)
| ~ r(sK0)
| ~ p(X2) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ r(sK1)
| ~ r(sK0)
| ~ q(X0)
| ~ p(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] :
( r(X1)
| ~ q(X0)
| ~ p(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] :
( p(f(X1))
| ~ q(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_52,negated_conjecture,
q(f(sK0)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
! [X0: $i] :
( ~ r(sK1)
| ~ q(X0)
| ~ p(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_50]) ).
tcf(c_73,plain,
! [X0: $i] :
( ~ q(X0)
| ~ p(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_68,c_50]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( ~ q(X1)
| ~ q(f(X0)) ),
inference(resolution,[status(thm)],[c_73,c_51]) ).
tcf(c_97,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ q(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_81]) ).
tcf(c_98,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ q(f(X0)) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_81]) ).
tcf(c_99,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_81]) ).
tcf(c_100,definition,
iPr_def_12 = f(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_101,plain,
( iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_99]) ).
tcf(c_102,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ q(f(X0)) ),
inference(demodulation,[status(thm)],[c_98]) ).
tcf(c_103,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ q(X0) ),
inference(demodulation,[status(thm)],[c_97]) ).
tcf(c_104,negated_conjecture,
q(iPr_def_12),
inference(demodulation,[status(thm)],[c_52,c_100]) ).
tcf(c_114,plain,
( ~ iPr_def_11
| ~ q(f(sK0)) ),
inference(instantiation,[status(thm)],[c_102]) ).
tcf(c_118,plain,
! [X0: $i] : ~ q(X0),
inference(global_subsumption_just,[status(thm)],[c_103,c_52,c_103,c_114,c_101]) ).
tcf(c_128,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_104,c_118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN941+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.13/0.37 % Computer : n019.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Fri Sep 25 02:37:03 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 1.73/1.30 % SZS status Started for theBenchmark.p
% 1.73/1.30 % SZS status Theorem for theBenchmark.p
% 1.73/1.30
% 1.73/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.73/1.30
% 1.73/1.30 % ------ iProver source info
% 1.73/1.30
% 1.73/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.73/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.73/1.30 % git: non_committed_changes: false
% 1.73/1.30
% 1.73/1.30 % ------ Parsing...
% 1.73/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.73/1.30
% 1.73/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.73/1.30
% 1.73/1.30 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.73/1.30
% 1.73/1.30 % ------ Preprocessing...%
% 1.73/1.30
% 1.73/1.30 % SZS status Theorem for theBenchmark.p
% 1.73/1.30
% 1.73/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/1.30
% 1.73/1.30
%------------------------------------------------------------------------------