%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV388+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 : n010.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:31 PM UTC 2026
% Result : Theorem 1.59s 6.18s
% Output : CNFRefutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 9 unt; 2 def)
% Number of atoms : 44 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 36 ( 20 ~; 7 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 24 ( 0 sgn 18 !; 6 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l24_l34) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l24_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(findmin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f83,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f44]) ).
fof(f85,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ok(findmin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(flattening,[],[f84]) ).
fof(f92,plain,
( ~ check_cpq(triple(sK0,sK1,sK2))
& ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f85]) ).
fof(f141,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f83]) ).
fof(f142,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f92]) ).
fof(f144,plain,
check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f92]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_96,negated_conjecture,
check_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f144]) ).
tcf(c_98,negated_conjecture,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f142]) ).
tcf(c_912,definition,
iPr_def_10 = triple(sK0,sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_913,definition,
iPr_def_11 = findmin_cpq_eff(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_914,negated_conjecture,
~ check_cpq(iPr_def_10),
inference(demodulation,[status(thm)],[c_98,c_912]) ).
tcf(c_916,negated_conjecture,
check_cpq(iPr_def_11),
inference(demodulation,[status(thm)],[c_96]) ).
tcf(c_1560,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ check_cpq(findmin_cpq_eff(iPr_def_10)) ),
inference(superposition,[status(thm)],[c_912,c_95]) ).
tcf(c_1561,plain,
( check_cpq(iPr_def_10)
| ~ check_cpq(iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_1560,c_912,c_913]) ).
tcf(c_1562,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1561,c_914,c_916]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV388+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.09/5.36 % Computer : n010.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Thu Sep 24 19:27:33 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.40 Running first-order theorem proving
% 0.13/5.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.13/5.41
% 0.13/5.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.41
% 0.13/5.41 % Detected problem language: tptp
% 0.13/5.42 % Proving...
% 1.59/6.18 % SZS status Started for theBenchmark.p
% 1.59/6.18 % SZS status Theorem for theBenchmark.p
% 1.59/6.18
% 1.59/6.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.59/6.18
% 1.59/6.18 % ------ iProver source info
% 1.59/6.18
% 1.59/6.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.59/6.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.59/6.18 % git: non_committed_changes: false
% 1.59/6.18
% 1.59/6.18 % ------ Parsing...
% 1.59/6.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.59/6.18
% 1.59/6.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 1.59/6.18
% 1.59/6.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.59/6.18
% 1.59/6.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.59/6.18 % ------ Proving...
% 1.59/6.18 % ------ Problem Properties
% 1.59/6.18
% 1.59/6.18 %
% 1.59/6.18 % clauses 45
% 1.59/6.18 % conjectures 3
% 1.59/6.18 % EPR 9
% 1.59/6.18 % Horn 31
% 1.59/6.18 % unary 20
% 1.59/6.18 % binary 13
% 1.59/6.18 % lits 83
% 1.59/6.18 % lits eq 30
% 1.59/6.18 % fd_pure 0
% 1.59/6.18 % fd_pseudo 0
% 1.59/6.18 % fd_cond 5
% 1.59/6.18 % fd_pseudo_cond 5
% 1.59/6.18 % AC symbols 0
% 1.59/6.18
% 1.59/6.18 % ------ Schedule dynamic 5 is on
% 1.59/6.18
% 1.59/6.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.59/6.18
% 1.59/6.18
% 1.59/6.18 % ------
% 1.59/6.18 % Current options:
% 1.59/6.18 % ------
% 1.59/6.18
% 1.59/6.18
% 1.59/6.18 %
% 1.59/6.18
% 1.59/6.18 % ------ Proving...
% 1.59/6.18 %
% 1.59/6.18
% 1.59/6.18 % SZS status Theorem for theBenchmark.p
% 1.59/6.18
% 1.59/6.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.59/6.18
% 1.59/6.18
%------------------------------------------------------------------------------