%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV376+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n020.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:17:29 PM UTC 2026
% Result : Theorem 3.36s 1.27s
% Output : CNFRefutation 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 16 unt; 2 def)
% Number of atoms : 153 ( 9 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 137 ( 60 ~; 54 |; 12 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 141 ( 0 sgn 117 !; 24 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(f42,axiom,
( ! [X0,X1,X2,X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ ok(triple(X3,X4,X5))
=> ~ ok(im_succ_cpq(triple(X3,X4,X5))) ) )
=> ! [X6,X7,X8] :
( ~ ok(triple(X6,X7,X8))
=> ! [X9,X10,X11] :
( succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11))
=> ~ ok(triple(X9,X10,X11)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_induction) ).
fof(f43,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_l13) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ~ ok(triple(X3,X4,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l12_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ~ ok(triple(X3,X4,X5)) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ok(triple(X0,X1,X2))
| X2 = bad ),
inference(ennf_transformation,[],[f29]) ).
fof(f84,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
& ~ ok(triple(X3,X4,X5))
& ok(im_succ_cpq(triple(X3,X4,X5))) )
| ! [X6,X7,X8] :
( ok(triple(X6,X7,X8))
| ! [X9,X10,X11] :
( ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11))
| ~ ok(triple(X9,X10,X11)) ) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f85,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
& ~ ok(triple(X3,X4,X5))
& ok(im_succ_cpq(triple(X3,X4,X5))) )
| ! [X6,X7,X8] :
( ok(triple(X6,X7,X8))
| ! [X9,X10,X11] :
( ~ succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11))
| ~ ok(triple(X9,X10,X11)) ) ) ),
inference(flattening,[],[f84]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ok(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f43]) ).
fof(f87,plain,
? [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
& ? [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
& ok(triple(X3,X4,X5)) ) ),
inference(ennf_transformation,[],[f45]) ).
fof(f94,plain,
( ? [X6,X7,X8,X9,X10,X11] :
( succ_cpq(triple(X6,X7,X8),triple(X9,X10,X11))
& ~ ok(triple(X9,X10,X11))
& ok(im_succ_cpq(triple(X9,X10,X11))) )
| ! [X0,X1,X2] :
( ok(triple(X0,X1,X2))
| ! [X3,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
inference(rectify,[],[f85]) ).
fof(f95,plain,
( ( succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5))
& ~ ok(triple(sK3,sK4,sK5))
& ok(im_succ_cpq(triple(sK3,sK4,sK5))) )
| ! [X0,X1,X2] :
( ok(triple(X0,X1,X2))
| ! [X3,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X6,sK0),skolemize(X7,sK1),skolemize(X8,sK2),skolemize(X9,sK3),skolemize(X10,sK4),skolemize(X11,sK5)],[f94]) ).
fof(f96,plain,
( ~ ok(triple(sK6,sK7,sK8))
& succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11))
& ok(triple(sK9,sK10,sK11)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X4,sK10),skolemize(X5,sK11)],[f87]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| bad = X2 ),
inference(cnf_transformation,[],[f71]) ).
fof(f146,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ ok(triple(sK3,sK4,sK5))
| ok(triple(X0,X1,X2))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f147,plain,
! [X2,X3,X0,X1,X4,X5] :
( ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ok(triple(X0,X1,X2))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f148,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f149,plain,
~ ok(triple(sK6,sK7,sK8)),
inference(cnf_transformation,[],[f96]) ).
fof(f150,plain,
succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f96]) ).
fof(f151,plain,
ok(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f96]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X1,X2,X0))
| ( X0 = bad ) ),
inference(cnf_transformation,[],[f132]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ok(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ok(triple(X0,X1,X2))
| ~ ok(triple(sK3,sK4,sK5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_99,negated_conjecture,
ok(triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f151]) ).
tcf(c_100,negated_conjecture,
succ_cpq(triple(sK6,sK7,sK8),triple(sK9,sK10,sK11)),
inference(cnf_transformation,[],[f150]) ).
tcf(c_101,negated_conjecture,
~ ok(triple(sK6,sK7,sK8)),
inference(cnf_transformation,[],[f149]) ).
tcf(c_1019,definition,
iPr_def_10 = triple(sK6,sK7,sK8),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1020,definition,
iPr_def_11 = triple(sK9,sK10,sK11),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1021,negated_conjecture,
~ ok(iPr_def_10),
inference(demodulation,[status(thm)],[c_101,c_1019]) ).
tcf(c_1022,negated_conjecture,
succ_cpq(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_100,c_1020]) ).
tcf(c_1023,negated_conjecture,
ok(iPr_def_11),
inference(demodulation,[status(thm)],[c_99]) ).
tcf(c_1726,plain,
( ok(iPr_def_10)
| ( bad = sK8 ) ),
inference(superposition,[status(thm)],[c_1019,c_84]) ).
tcf(c_1728,plain,
bad = sK8,
inference(forward_subsumption_resolution,[status(thm)],[c_1726,c_1021]) ).
tcf(c_1731,plain,
triple(sK6,sK7,bad) = iPr_def_10,
inference(demodulation,[status(thm)],[c_1019,c_1728]) ).
tcf(c_2740,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ~ ok(triple(sK9,sK10,sK11))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(superposition,[status(thm)],[c_1020,c_95]) ).
tcf(c_2744,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ~ ok(iPr_def_11)
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_2740,c_1020]) ).
tcf(c_2745,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2744,c_1023]) ).
tcf(c_2790,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ~ ok(triple(sK9,sK10,sK11))
| ~ ok(triple(sK3,sK4,sK5))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(superposition,[status(thm)],[c_1020,c_96]) ).
tcf(c_2794,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ~ ok(iPr_def_11)
| ~ ok(triple(sK3,sK4,sK5))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_2790,c_1020]) ).
tcf(c_2795,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ~ ok(triple(sK3,sK4,sK5))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2794,c_1023]) ).
tcf(c_2871,plain,
( ok(triple(sK6,sK7,bad))
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ~ succ_cpq(iPr_def_10,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1731,c_2745]) ).
tcf(c_2873,plain,
( ok(iPr_def_10)
| ok(im_succ_cpq(triple(sK3,sK4,sK5)))
| ~ succ_cpq(iPr_def_10,iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_2871,c_1731]) ).
tcf(c_2874,plain,
ok(im_succ_cpq(triple(sK3,sK4,sK5))),
inference(forward_subsumption_resolution,[status(thm)],[c_2873,c_1021,c_1022]) ).
tcf(c_2875,plain,
ok(triple(sK3,sK4,sK5)),
inference(superposition,[status(thm)],[c_2874,c_98]) ).
tcf(c_2880,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(global_subsumption_just,[status(thm)],[c_2795,c_2795,c_2875]) ).
tcf(c_2889,plain,
( ok(triple(sK6,sK7,bad))
| ~ succ_cpq(iPr_def_10,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1731,c_2880]) ).
tcf(c_2891,plain,
( ok(iPr_def_10)
| ~ succ_cpq(iPr_def_10,iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_2889,c_1731]) ).
tcf(c_2892,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2891,c_1021,c_1022]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV376+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n020.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 19:25:35 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 3.36/1.27 % SZS status Started for theBenchmark.p
% 3.36/1.27 % SZS status Theorem for theBenchmark.p
% 3.36/1.27
% 3.36/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.36/1.27
% 3.36/1.27 % ------ iProver source info
% 3.36/1.27
% 3.36/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.36/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.36/1.27 % git: non_committed_changes: false
% 3.36/1.27
% 3.36/1.27 % ------ Parsing...
% 3.36/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.36/1.27
% 3.36/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.36/1.27
% 3.36/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.36/1.27
% 3.36/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.36/1.27 % ------ Proving...
% 3.36/1.27 % ------ Problem Properties
% 3.36/1.27
% 3.36/1.27 %
% 3.36/1.27 % clauses 53
% 3.36/1.27 % conjectures 3
% 3.36/1.27 % EPR 10
% 3.36/1.27 % Horn 37
% 3.36/1.27 % unary 21
% 3.36/1.27 % binary 17
% 3.36/1.27 % lits 104
% 3.36/1.27 % lits eq 30
% 3.36/1.27 % fd_pure 0
% 3.36/1.27 % fd_pseudo 0
% 3.36/1.27 % fd_cond 5
% 3.36/1.27 % fd_pseudo_cond 5
% 3.36/1.27 % AC symbols 0
% 3.36/1.27
% 3.36/1.27 % ------ Schedule dynamic 5 is on
% 3.36/1.27
% 3.36/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.36/1.27
% 3.36/1.27
% 3.36/1.27 % ------
% 3.36/1.27 % Current options:
% 3.36/1.27 % ------
% 3.36/1.27
% 3.36/1.27
% 3.36/1.27 %
% 3.36/1.27
% 3.36/1.27 % ------ Proving...
% 3.36/1.27 %
% 3.36/1.27
% 3.36/1.27 % SZS status Theorem for theBenchmark.p
% 3.36/1.27
% 3.36/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.36/1.28
% 3.36/1.28
%------------------------------------------------------------------------------