%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV383+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 : n013.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:30 PM UTC 2026
% Result : Theorem 2.36s 1.28s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 15 unt; 2 def)
% Number of atoms : 89 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 80 ( 38 ~; 25 |; 11 &)
% ( 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 : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 63 ( 0 sgn 51 !; 12 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_l20) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l19_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) )
| ! [X3,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) )
| ! [X3,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ? [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
& check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5)) ) ),
inference(ennf_transformation,[],[f44]) ).
fof(f86,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ? [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
& check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5)) ) ),
inference(flattening,[],[f85]) ).
fof(f93,plain,
( ~ check_cpq(triple(sK0,sK1,sK2))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5))
& check_cpq(triple(sK3,sK4,sK5))
& ok(triple(sK3,sK4,sK5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f86]) ).
fof(f143,plain,
! [X2,X3,X0,X1,X4,X5] :
( check_cpq(triple(X0,X1,X2))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ),
inference(cnf_transformation,[],[f84]) ).
fof(f144,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f93]) ).
fof(f145,plain,
succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f93]) ).
fof(f146,plain,
check_cpq(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f93]) ).
fof(f147,plain,
ok(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f93]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) ),
inference(cnf_transformation,[],[f143]) ).
tcf(c_97,negated_conjecture,
ok(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f147]) ).
tcf(c_98,negated_conjecture,
check_cpq(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f146]) ).
tcf(c_99,negated_conjecture,
succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f145]) ).
tcf(c_100,negated_conjecture,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f144]) ).
tcf(c_971,definition,
iPr_def_10 = triple(sK0,sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_972,definition,
iPr_def_11 = triple(sK3,sK4,sK5),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_973,negated_conjecture,
~ check_cpq(iPr_def_10),
inference(demodulation,[status(thm)],[c_100,c_971]) ).
tcf(c_974,negated_conjecture,
succ_cpq(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_99,c_972]) ).
tcf(c_975,negated_conjecture,
check_cpq(iPr_def_11),
inference(demodulation,[status(thm)],[c_98]) ).
tcf(c_976,negated_conjecture,
ok(iPr_def_11),
inference(demodulation,[status(thm)],[c_97]) ).
tcf(c_2506,plain,
! [X0: $i,X1: $i,X2: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(triple(sK3,sK4,sK5))
| ~ check_cpq(triple(sK3,sK4,sK5))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(superposition,[status(thm)],[c_972,c_95]) ).
tcf(c_2509,plain,
! [X0: $i,X1: $i,X2: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(iPr_def_11)
| ~ check_cpq(iPr_def_11)
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_2506,c_972]) ).
tcf(c_2510,plain,
! [X0: $i,X1: $i,X2: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ succ_cpq(triple(X0,X1,X2),iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2509,c_976,c_975]) ).
tcf(c_2640,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ succ_cpq(iPr_def_10,iPr_def_11) ),
inference(superposition,[status(thm)],[c_971,c_2510]) ).
tcf(c_2641,plain,
( check_cpq(iPr_def_10)
| ~ succ_cpq(iPr_def_10,iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_2640,c_971]) ).
tcf(c_2642,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2641,c_973,c_974]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV383+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.10/0.35 % Computer : n013.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 : Thu Sep 24 19:26:12 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 2.36/1.28 % SZS status Started for theBenchmark.p
% 2.36/1.28 % SZS status Theorem for theBenchmark.p
% 2.36/1.28
% 2.36/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.36/1.28
% 2.36/1.28 % ------ iProver source info
% 2.36/1.28
% 2.36/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.36/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.36/1.28 % git: non_committed_changes: false
% 2.36/1.28
% 2.36/1.28 % ------ Parsing...
% 2.36/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.36/1.28
% 2.36/1.28 % ------ 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 %
% 2.36/1.28
% 2.36/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.36/1.28
% 2.36/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.36/1.28 % ------ Proving...
% 2.36/1.28 % ------ Problem Properties
% 2.36/1.28
% 2.36/1.28 %
% 2.36/1.28 % clauses 52
% 2.36/1.28 % conjectures 4
% 2.36/1.28 % EPR 11
% 2.36/1.28 % Horn 38
% 2.36/1.28 % unary 22
% 2.36/1.28 % binary 16
% 2.36/1.28 % lits 99
% 2.36/1.28 % lits eq 30
% 2.36/1.28 % fd_pure 0
% 2.36/1.28 % fd_pseudo 0
% 2.36/1.28 % fd_cond 5
% 2.36/1.28 % fd_pseudo_cond 5
% 2.36/1.28 % AC symbols 0
% 2.36/1.28
% 2.36/1.28 % ------ Schedule dynamic 5 is on
% 2.36/1.28
% 2.36/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.36/1.28
% 2.36/1.28
% 2.36/1.28 % ------
% 2.36/1.28 % Current options:
% 2.36/1.28 % ------
% 2.36/1.28
% 2.36/1.28
% 2.36/1.28 %
% 2.36/1.28
% 2.36/1.28 % ------ Proving...
% 2.36/1.28 %
% 2.36/1.28
% 2.36/1.28 % SZS status Theorem for theBenchmark.p
% 2.36/1.28
% 2.36/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.36/1.29
% 2.36/1.29
%------------------------------------------------------------------------------