%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN364+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.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:52 PM UTC 2026
% Result : Theorem 1.48s 1.27s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 35 ( 9 unt; 1 def)
% Number of atoms : 112 ( 1 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 123 ( 48 ~; 38 |; 28 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn 68 !; 15 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X5] :
( big_q(X5)
=> ~ big_m(g(X5)) )
& ! [X3] :
? [X4] :
( ( big_q(f(X3,X4))
& big_m(X3) )
| big_p(X3,X4) )
& ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X2] : big_p(X2,X2) ) )
=> ! [X3] :
? [X4] :
( big_p(X3,X3)
& big_p(g(X3),X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2115) ).
fof(f2,negated_conjecture,
~ ( ( ! [X5] :
( big_q(X5)
=> ~ big_m(g(X5)) )
& ! [X3] :
? [X4] :
( ( big_q(f(X3,X4))
& big_m(X3) )
| big_p(X3,X4) )
& ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X2] : big_p(X2,X2) ) )
=> ! [X3] :
? [X4] :
( big_p(X3,X3)
& big_p(g(X3),X4) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,plain,
~ ( ( ! [X5] :
( big_q(X5)
=> ~ big_m(g(X5)) )
& ! [X3] :
? [X4] :
( ( big_q(f(X3,X4))
& big_m(X3) )
| big_p(X3,X4) )
& ! [X0] :
( ? [X1] : big_p(X0,X1)
=> ! [X2] : big_p(X2,X2) ) )
=> ! [X6] :
? [X7] :
( big_p(X6,X6)
& big_p(g(X6),X7) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ! [X5] :
( ~ big_q(X5)
| ~ big_m(g(X5)) )
& ! [X3] :
? [X4] :
( ( big_q(f(X3,X4))
& big_m(X3) )
| big_p(X3,X4) )
& ! [X0] :
( ! [X1] : ~ big_p(X0,X1)
| ! [X2] : big_p(X2,X2) )
& ? [X6] :
! [X7] :
( ~ big_p(X6,X6)
| ~ big_p(g(X6),X7) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ! [X5] :
( ~ big_q(X5)
| ~ big_m(g(X5)) )
& ! [X3] :
? [X4] :
( ( big_q(f(X3,X4))
& big_m(X3) )
| big_p(X3,X4) )
& ! [X0] :
( ! [X1] : ~ big_p(X0,X1)
| ! [X2] : big_p(X2,X2) )
& ? [X6] :
! [X7] :
( ~ big_p(X6,X6)
| ~ big_p(g(X6),X7) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ! [X7] :
( ~ big_q(X7)
| ~ big_m(g(X7)) )
& ! [X5] :
? [X6] :
( ( big_q(f(X5,X6))
& big_m(X5) )
| big_p(X5,X6) )
& ! [X2] :
( ! [X4] : ~ big_p(X2,X4)
| ! [X3] : big_p(X3,X3) )
& ? [X0] :
! [X1] :
( ~ big_p(X0,X0)
| ~ big_p(g(X0),X1) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ! [X7] :
( ~ big_q(X7)
| ~ big_m(g(X7)) )
& ! [X5] :
( ( big_q(f(X5,sK1(X5)))
& big_m(X5) )
| big_p(X5,sK1(X5)) )
& ! [X2] :
( ! [X4] : ~ big_p(X2,X4)
| ! [X3] : big_p(X3,X3) )
& ! [X1] :
( ~ big_p(sK0,sK0)
| ~ big_p(g(sK0),X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X6,sK1(X5))],[f6]) ).
fof(f8,plain,
! [X7] :
( ~ big_q(X7)
| ~ big_m(g(X7)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f9,plain,
! [X5] :
( big_q(f(X5,sK1(X5)))
| big_p(X5,sK1(X5)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f10,plain,
! [X5] :
( big_m(X5)
| big_p(X5,sK1(X5)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X3,X4] :
( ~ big_p(X2,X4)
| big_p(X3,X3) ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X1] :
( ~ big_p(sK0,sK0)
| ~ big_p(g(sK0),X1) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ big_p(sK0,sK0)
| ~ big_p(g(sK0),X0) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( big_p(X2,X2)
| ~ big_p(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( big_m(X0)
| big_p(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f10]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( big_p(X0,sK1(X0))
| big_q(f(X0,sK1(X0))) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_53,negated_conjecture,
! [X0: $i] :
( ~ big_q(X0)
| ~ big_m(g(X0)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,plain,
! [X0: $i] : ~ big_p(g(sK0),X0),
inference(backward_subsumption_resolution,[status(thm)],[c_49,c_50]) ).
tcf(c_78,plain,
! [X0: $i] :
( big_p(g(X0),sK1(g(X0)))
| ~ big_q(X0) ),
inference(resolution,[status(thm)],[c_51,c_53]) ).
tcf(c_121,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| big_p(X0,X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_50]) ).
tcf(c_122,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_11
| ~ big_p(X0,X1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_50]) ).
tcf(c_123,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_50]) ).
tcf(c_124,definition,
iPr_def_12 = g(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_125,plain,
! [X0: $i] :
( big_p(g(X0),sK1(g(X0)))
| ~ big_q(X0) ),
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_126,plain,
! [X0: $i] : ~ big_p(iPr_def_12,X0),
inference(demodulation,[status(thm)],[c_66,c_124]) ).
tcf(c_127,negated_conjecture,
! [X0: $i] :
( big_p(X0,sK1(X0))
| big_q(f(X0,sK1(X0))) ),
inference(demodulation,[status(thm)],[c_52]) ).
tcf(c_128,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_123]) ).
tcf(c_129,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ iPr_def_11
| ~ big_p(X0,X1) ),
inference(demodulation,[status(thm)],[c_122]) ).
tcf(c_130,negated_conjecture,
! [X0: $i] :
( big_p(X0,X0)
| ~ iPr_def_10 ),
inference(demodulation,[status(thm)],[c_121]) ).
tcf(c_286,plain,
~ iPr_def_10,
inference(superposition,[status(thm)],[c_130,c_126]) ).
tcf(c_287,plain,
iPr_def_11,
inference(backward_subsumption_resolution,[status(thm)],[c_128,c_286]) ).
tcf(c_288,plain,
! [X0: $i,X1: $i] : ~ big_p(X0,X1),
inference(backward_subsumption_resolution,[status(thm)],[c_129,c_287]) ).
tcf(c_289,plain,
! [X0: $i] : big_q(f(X0,sK1(X0))),
inference(backward_subsumption_resolution,[status(thm)],[c_127,c_288]) ).
tcf(c_297,plain,
! [X0: $i] : ~ big_q(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_125,c_288]) ).
tcf(c_299,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_289,c_297]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN364+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 01:02:25 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.48/1.27 % SZS status Started for theBenchmark.p
% 1.48/1.27 % SZS status Theorem for theBenchmark.p
% 1.48/1.27
% 1.48/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/1.27
% 1.48/1.27 % ------ iProver source info
% 1.48/1.27
% 1.48/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.48/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/1.27 % git: non_committed_changes: false
% 1.48/1.27
% 1.48/1.27 % ------ Parsing...
% 1.48/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.48/1.27
% 1.48/1.27 % ------ 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.48/1.27
% 1.48/1.27 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.48/1.27
% 1.48/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.48/1.27 % ------ Proving...
% 1.48/1.27 % ------ Problem Properties
% 1.48/1.27
% 1.48/1.27 %
% 1.48/1.27 % clauses 7
% 1.48/1.27 % conjectures 4
% 1.48/1.27 % EPR 4
% 1.48/1.27 % Horn 5
% 1.48/1.27 % unary 2
% 1.48/1.27 % binary 5
% 1.48/1.27 % lits 12
% 1.48/1.27 % lits eq 1
% 1.48/1.27 % fd_pure 0
% 1.48/1.27 % fd_pseudo 0
% 1.48/1.27 % fd_cond 0
% 1.48/1.27 % fd_pseudo_cond 0
% 1.48/1.27 % AC symbols 0
% 1.48/1.27
% 1.48/1.27 % ------ Schedule dynamic 5 is on
% 1.48/1.27
% 1.48/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.48/1.27
% 1.48/1.27
% 1.48/1.27 % ------
% 1.48/1.27 % Current options:
% 1.48/1.27 % ------
% 1.48/1.27
% 1.48/1.27
% 1.48/1.27 %
% 1.48/1.27
% 1.48/1.27 % ------ Proving...
% 1.48/1.27 %
% 1.48/1.27
% 1.48/1.27 % SZS status Theorem for theBenchmark.p
% 1.48/1.27
% 1.48/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/1.27
% 1.48/1.27
%------------------------------------------------------------------------------