%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN386+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 : 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:39:55 PM UTC 2026
% Result : Theorem 1.49s 1.15s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 35 ( 19 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 136 ( 50 ~; 39 |; 29 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 6 ( 2 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-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 167 ( 0 sgn 128 !; 39 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X2] :
? [X5] :
! [X6,X7] :
( big_d(X6,X7,X5)
=> ! [X1,X8] :
( ( big_f(X7,X8)
& big_f(X6,X1) )
=> big_d(X1,X8,X2) ) )
& ? [X0] :
! [X2] :
? [X3] :
! [X4] :
( big_s(X3,X4)
=> big_d(X4,X0,X2) )
& ! [X0] :
? [X1] : big_f(X0,X1) )
=> ? [X1] :
! [X2] :
? [X9] :
! [X4] :
( big_s(X9,X4)
=> ! [X8] :
( big_f(X4,X8)
=> big_d(X8,X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2138) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2] :
? [X5] :
! [X6,X7] :
( big_d(X6,X7,X5)
=> ! [X1,X8] :
( ( big_f(X7,X8)
& big_f(X6,X1) )
=> big_d(X1,X8,X2) ) )
& ? [X0] :
! [X2] :
? [X3] :
! [X4] :
( big_s(X3,X4)
=> big_d(X4,X0,X2) )
& ! [X0] :
? [X1] : big_f(X0,X1) )
=> ? [X1] :
! [X2] :
? [X9] :
! [X4] :
( big_s(X9,X4)
=> ! [X8] :
( big_f(X4,X8)
=> big_d(X8,X1,X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ! [X6] :
? [X7] :
! [X8,X9] :
( big_d(X8,X9,X7)
=> ! [X10,X11] :
( ( big_f(X9,X11)
& big_f(X8,X10) )
=> big_d(X10,X11,X6) ) )
& ? [X2] :
! [X3] :
? [X4] :
! [X5] :
( big_s(X4,X5)
=> big_d(X5,X2,X3) )
& ! [X0] :
? [X1] : big_f(X0,X1) )
=> ? [X12] :
! [X13] :
? [X14] :
! [X15] :
( big_s(X14,X15)
=> ! [X16] :
( big_f(X15,X16)
=> big_d(X16,X12,X13) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X6] :
? [X7] :
! [X8,X9] :
( ~ big_d(X8,X9,X7)
| ! [X10,X11] :
( ~ big_f(X9,X11)
| ~ big_f(X8,X10)
| big_d(X10,X11,X6) ) )
& ? [X2] :
! [X3] :
? [X4] :
! [X5] :
( ~ big_s(X4,X5)
| big_d(X5,X2,X3) )
& ! [X0] :
? [X1] : big_f(X0,X1)
& ! [X12] :
? [X13] :
! [X14] :
? [X15] :
( big_s(X14,X15)
& ? [X16] :
( big_f(X15,X16)
& ~ big_d(X16,X12,X13) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X6] :
? [X7] :
! [X8,X9] :
( ~ big_d(X8,X9,X7)
| ! [X10,X11] :
( ~ big_f(X9,X11)
| ~ big_f(X8,X10)
| big_d(X10,X11,X6) ) )
& ? [X2] :
! [X3] :
? [X4] :
! [X5] :
( ~ big_s(X4,X5)
| big_d(X5,X2,X3) )
& ! [X0] :
? [X1] : big_f(X0,X1)
& ! [X12] :
? [X13] :
! [X14] :
? [X15] :
( big_s(X14,X15)
& ? [X16] :
( big_f(X15,X16)
& ~ big_d(X16,X12,X13) ) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X11] :
? [X12] :
! [X13,X14] :
( ~ big_d(X13,X14,X12)
| ! [X15,X16] :
( ~ big_f(X14,X16)
| ~ big_f(X13,X15)
| big_d(X15,X16,X11) ) )
& ? [X7] :
! [X8] :
? [X9] :
! [X10] :
( ~ big_s(X9,X10)
| big_d(X10,X7,X8) )
& ! [X5] :
? [X6] : big_f(X5,X6)
& ! [X0] :
? [X1] :
! [X2] :
? [X3] :
( big_s(X2,X3)
& ? [X4] :
( big_f(X3,X4)
& ~ big_d(X4,X0,X1) ) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X11,X13,X14] :
( ~ big_d(X13,X14,sK6(X11))
| ! [X15,X16] :
( ~ big_f(X14,X16)
| ~ big_f(X13,X15)
| big_d(X15,X16,X11) ) )
& ! [X8,X10] :
( ~ big_s(sK5(X8),X10)
| big_d(X10,sK4,X8) )
& ! [X5] : big_f(X5,sK3(X5))
& ! [X0,X2] :
( big_s(X2,sK1(X0,X2))
& big_f(sK1(X0,X2),sK2(X0,X2))
& ~ big_d(sK2(X0,X2),X0,sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X1,sK0(X0)),skolemize(X3,sK1(X0,X2)),skolemize(X4,sK2(X0,X2)),skolemize(X6,sK3(X5)),skolemize(X7,sK4),skolemize(X9,sK5(X8)),skolemize(X12,sK6(X11))],[f6]) ).
fof(f8,plain,
! [X11,X16,X14,X15,X13] :
( ~ big_d(X13,X14,sK6(X11))
| ~ big_f(X14,X16)
| ~ big_f(X13,X15)
| big_d(X15,X16,X11) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X10,X8] :
( ~ big_s(sK5(X8),X10)
| big_d(X10,sK4,X8) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X5] : big_f(X5,sK3(X5)),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X0] : big_s(X2,sK1(X0,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X2,X0] : big_f(sK1(X0,X2),sK2(X0,X2)),
inference(cnf_transformation,[],[f7]) ).
fof(f13,plain,
! [X2,X0] : ~ big_d(sK2(X0,X2),X0,sK0(X0)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
! [X0: $i,X1: $i] : ~ big_d(sK2(X0,X1),X0,sK0(X0)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i] : big_f(sK1(X0,X1),sK2(X0,X1)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] : big_s(X0,sK1(X1,X0)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] : big_f(X0,sK3(X0)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_53,negated_conjecture,
! [X0: $i,X1: $i] :
( big_d(X1,sK4,X0)
| ~ big_s(sK5(X0),X1) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_54,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( big_d(X3,X4,X2)
| ~ big_f(X1,X4)
| ~ big_f(X0,X3)
| ~ big_d(X0,X1,sK6(X2)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_55,plain,
big_f(sK4,sK3(sK4)),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] : big_d(sK1(X0,sK5(X1)),sK4,X1),
inference(resolution,[status(thm)],[c_51,c_53]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i] : big_d(sK1(X0,sK5(X1)),sK4,X1),
inference(demodulation,[status(thm)],[c_81]) ).
tcf(c_104,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( big_d(X3,X4,X2)
| ~ big_f(X1,X4)
| ~ big_f(X0,X3)
| ~ big_d(X0,X1,sK6(X2)) ),
inference(demodulation,[status(thm)],[c_54]) ).
tcf(c_106,negated_conjecture,
! [X0: $i,X1: $i] : big_f(sK1(X0,X1),sK2(X0,X1)),
inference(demodulation,[status(thm)],[c_50]) ).
tcf(c_107,negated_conjecture,
! [X0: $i,X1: $i] : ~ big_d(sK2(X0,X1),X0,sK0(X0)),
inference(demodulation,[status(thm)],[c_49]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( big_d(sK2(X0,X1),X4,X3)
| ~ big_f(X2,X4)
| ~ big_f(sK1(X0,X1),sK2(X0,X1))
| ~ big_d(sK1(X0,X1),X2,sK6(X3)) ),
inference(instantiation,[status(thm)],[c_104]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i,X2: $i] :
( big_d(sK2(X0,X1),X0,sK0(X0))
| ~ big_f(X2,X0)
| ~ big_f(sK1(X0,X1),sK2(X0,X1))
| ~ big_d(sK1(X0,X1),X2,sK6(sK0(X0))) ),
inference(instantiation,[status(thm)],[c_108]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i] :
( big_d(sK2(sK3(X0),X1),sK3(X0),sK0(sK3(X0)))
| ~ big_f(X0,sK3(X0))
| ~ big_f(sK1(sK3(X0),X1),sK2(sK3(X0),X1))
| ~ big_d(sK1(sK3(X0),X1),X0,sK6(sK0(sK3(X0)))) ),
inference(instantiation,[status(thm)],[c_112]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i] : ~ big_d(sK2(sK3(X0),X1),sK3(X0),sK0(sK3(X0))),
inference(instantiation,[status(thm)],[c_107]) ).
tcf(c_136,plain,
( big_d(sK2(sK3(sK4),sK5(sK6(sK0(sK3(sK4))))),sK3(sK4),sK0(sK3(sK4)))
| ~ big_f(sK4,sK3(sK4))
| ~ big_d(sK1(sK3(sK4),sK5(sK6(sK0(sK3(sK4))))),sK4,sK6(sK0(sK3(sK4))))
| ~ big_f(sK1(sK3(sK4),sK5(sK6(sK0(sK3(sK4))))),sK2(sK3(sK4),sK5(sK6(sK0(sK3(sK4)))))) ),
inference(instantiation,[status(thm)],[c_116]) ).
tcf(c_137,plain,
big_d(sK1(sK3(sK4),sK5(sK6(sK0(sK3(sK4))))),sK4,sK6(sK0(sK3(sK4)))),
inference(instantiation,[status(thm)],[c_103]) ).
tcf(c_143,plain,
~ big_d(sK2(sK3(sK4),sK5(sK6(sK0(sK3(sK4))))),sK3(sK4),sK0(sK3(sK4))),
inference(instantiation,[status(thm)],[c_118]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] : big_f(sK1(X0,sK5(sK6(X1))),sK2(X0,sK5(sK6(X1)))),
inference(instantiation,[status(thm)],[c_106]) ).
tcf(c_182,plain,
big_f(sK1(sK3(sK4),sK5(sK6(sK0(sK3(sK4))))),sK2(sK3(sK4),sK5(sK6(sK0(sK3(sK4)))))),
inference(instantiation,[status(thm)],[c_150]) ).
tcf(c_183,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_182,c_143,c_137,c_136,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN386+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.10/0.35 % Computer : n004.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Fri Sep 25 01:03:21 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/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.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 1.49/1.15 % SZS status Started for theBenchmark.p
% 1.49/1.15 % SZS status Theorem for theBenchmark.p
% 1.49/1.15
% 1.49/1.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.49/1.15
% 1.49/1.15 % ------ iProver source info
% 1.49/1.15
% 1.49/1.15 % git: date: 2026-07-19 20:42:38 +0200
% 1.49/1.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.49/1.15 % git: non_committed_changes: false
% 1.49/1.15
% 1.49/1.15 % ------ Parsing...
% 1.49/1.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.49/1.15
% 1.49/1.15 % ------ 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.49/1.15
% 1.49/1.15 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.49/1.15 % ------ Proving...
% 1.49/1.15 % ------ Problem Properties
% 1.49/1.15
% 1.49/1.15 %
% 1.49/1.15 % clauses 5
% 1.49/1.15 % conjectures 4
% 1.49/1.15 % EPR 0
% 1.49/1.15 % Horn 5
% 1.49/1.15 % unary 4
% 1.49/1.15 % binary 0
% 1.49/1.15 % lits 8
% 1.49/1.15 % lits eq 0
% 1.49/1.15 % fd_pure 0
% 1.49/1.15 % fd_pseudo 0
% 1.49/1.15 % fd_cond 0
% 1.49/1.15 % fd_pseudo_cond 0
% 1.49/1.15 % AC symbols 0
% 1.49/1.15
% 1.49/1.15 % ------ Schedule dynamic 5 is on
% 1.49/1.15
% 1.49/1.15 % ------ no equalities: superposition off
% 1.49/1.15
% 1.49/1.15 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.49/1.15
% 1.49/1.15
% 1.49/1.15 % ------
% 1.49/1.15 % Current options:
% 1.49/1.15 % ------
% 1.49/1.15
% 1.49/1.15
% 1.49/1.15 %
% 1.49/1.15
% 1.49/1.15 % ------ Proving...
% 1.49/1.15 %
% 1.49/1.15
% 1.49/1.15 % SZS status Theorem for theBenchmark.p
% 1.49/1.15
% 1.49/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.49/1.16
% 1.49/1.16
%------------------------------------------------------------------------------