%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN943+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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:29 PM UTC 2026
% Result : Theorem 1.14s 1.28s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 129 ( 43 ~; 48 |; 30 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 0 sgn 28 !; 12 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
? [X1,X2,X3,X4,X5] :
( ( ( s(X0,X5)
=> p(X5) )
& ( e(X2)
=> ( c(f(X2))
| g(X2) ) )
& ( e(X1)
=> ( s(X1,f(X1))
| g(X1) ) )
& e(X0)
& p(X0) )
=> ( ( c(X4)
& p(X4) )
| ( g(X3)
& p(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1,X2,X3,X4,X5] :
( ( ( s(X0,X5)
=> p(X5) )
& ( e(X2)
=> ( c(f(X2))
| g(X2) ) )
& ( e(X1)
=> ( s(X1,f(X1))
| g(X1) ) )
& e(X0)
& p(X0) )
=> ( ( c(X4)
& p(X4) )
| ( g(X3)
& p(X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
? [X0] :
! [X1,X2,X3,X4,X5] :
( ( ~ s(X0,X5)
| p(X5) )
& ( ~ e(X2)
| c(f(X2))
| g(X2) )
& ( ~ e(X1)
| s(X1,f(X1))
| g(X1) )
& e(X0)
& p(X0)
& ( ~ c(X4)
| ~ p(X4) )
& ( ~ g(X3)
| ~ p(X3) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f4,plain,
? [X0] :
! [X1,X2,X3,X4,X5] :
( ( ~ s(X0,X5)
| p(X5) )
& ( ~ e(X2)
| c(f(X2))
| g(X2) )
& ( ~ e(X1)
| s(X1,f(X1))
| g(X1) )
& e(X0)
& p(X0)
& ( ~ c(X4)
| ~ p(X4) )
& ( ~ g(X3)
| ~ p(X3) ) ),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X1,X2,X3,X4,X5] :
( ( ~ s(sK0,X5)
| p(X5) )
& ( ~ e(X2)
| c(f(X2))
| g(X2) )
& ( ~ e(X1)
| s(X1,f(X1))
| g(X1) )
& e(sK0)
& p(sK0)
& ( ~ c(X4)
| ~ p(X4) )
& ( ~ g(X3)
| ~ p(X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f4]) ).
fof(f6,plain,
! [X5] :
( ~ s(sK0,X5)
| p(X5) ),
inference(cnf_transformation,[],[f5]) ).
fof(f7,plain,
! [X2] :
( ~ e(X2)
| c(f(X2))
| g(X2) ),
inference(cnf_transformation,[],[f5]) ).
fof(f8,plain,
! [X1] :
( ~ e(X1)
| s(X1,f(X1))
| g(X1) ),
inference(cnf_transformation,[],[f5]) ).
fof(f9,plain,
e(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f10,plain,
p(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f11,plain,
! [X4] :
( ~ c(X4)
| ~ p(X4) ),
inference(cnf_transformation,[],[f5]) ).
fof(f12,plain,
! [X3] :
( ~ g(X3)
| ~ p(X3) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ g(X0)
| ~ p(X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( ~ c(X0)
| ~ p(X0) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,negated_conjecture,
p(sK0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_52,negated_conjecture,
e(sK0),
inference(cnf_transformation,[],[f9]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( g(X0)
| s(X0,f(X0))
| ~ e(X0) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] :
( g(X0)
| c(f(X0))
| ~ e(X0) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] :
( p(X0)
| ~ s(sK0,X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_57,plain,
( ~ g(sK0)
| ~ p(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_88,plain,
! [X0: $i] :
( g(X0)
| ~ e(X0)
| ~ p(f(X0)) ),
inference(resolution,[status(thm)],[c_50,c_54]) ).
tcf(c_89,plain,
( g(sK0)
| ~ e(sK0)
| ~ p(f(sK0)) ),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_102,plain,
( g(sK0)
| p(f(sK0))
| ~ e(sK0) ),
inference(resolution,[status(thm)],[c_53,c_55]) ).
tcf(c_103,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_102,c_89,c_57,c_51,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN943+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 02:31:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.14/1.28 % SZS status Started for theBenchmark.p
% 1.14/1.28 % SZS status Theorem for theBenchmark.p
% 1.14/1.28
% 1.14/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.14/1.28
% 1.14/1.28 % ------ iProver source info
% 1.14/1.28
% 1.14/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.14/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.14/1.28 % git: non_committed_changes: false
% 1.14/1.28
% 1.14/1.28 % ------ Parsing...
% 1.14/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.14/1.28
% 1.14/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s%
% 1.14/1.28
% 1.14/1.28 % SZS status Theorem for theBenchmark.p
% 1.14/1.28
% 1.14/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.14/1.28
% 1.14/1.28
%------------------------------------------------------------------------------