%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV389+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 : 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:17:31 PM UTC 2026
% Result : Theorem 1.88s 1.29s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 21 unt; 4 def)
% Number of atoms : 76 ( 9 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 53 ( 27 ~; 16 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 35 ( 0 sgn 29 !; 6 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f40,axiom,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax52) ).
fof(f41,axiom,
! [X0] : removemin_cpq_res(X0) = findmin_cpq_res(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax53) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( ok(removemin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) )
=> check_cpq(triple(X0,X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_l40) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ok(removemin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f44]) ).
fof(f86,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ok(removemin_cpq_eff(triple(X0,X1,X2)))
& check_cpq(removemin_cpq_eff(triple(X0,X1,X2))) ),
inference(flattening,[],[f85]) ).
fof(f93,plain,
( ~ check_cpq(triple(sK0,sK1,sK2))
& ok(removemin_cpq_eff(triple(sK0,sK1,sK2)))
& check_cpq(removemin_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)],[f86]) ).
fof(f140,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),findmin_cpq_res(X0)),
inference(cnf_transformation,[],[f40]) ).
fof(f141,plain,
! [X0] : findmin_cpq_res(X0) = removemin_cpq_res(X0),
inference(cnf_transformation,[],[f41]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ ok(removemin_cpq_eff(triple(X0,X1,X2)))
| ~ check_cpq(removemin_cpq_eff(triple(X0,X1,X2)))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f84]) ).
fof(f143,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f93]) ).
fof(f144,plain,
ok(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f93]) ).
fof(f145,plain,
check_cpq(removemin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f93]) ).
fof(f146,plain,
! [X0] : removemin_cpq_eff(X0) = remove_cpq(findmin_cpq_eff(X0),removemin_cpq_res(X0)),
inference(definition_unfolding,[],[f140,f141]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))))
| check_cpq(triple(X0,X1,X2)) ),
inference(definition_unfolding,[],[f142,f146,f146]) ).
fof(f151,plain,
check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f145,f146]) ).
fof(f152,plain,
ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(definition_unfolding,[],[f144,f146]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2))))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(triple(X0,X1,X2)),removemin_cpq_res(triple(X0,X1,X2)))) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_96,negated_conjecture,
check_cpq(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(cnf_transformation,[],[f151]) ).
tcf(c_97,negated_conjecture,
ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))),
inference(cnf_transformation,[],[f152]) ).
tcf(c_98,negated_conjecture,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f143]) ).
tcf(c_980,definition,
iPr_def_10 = triple(sK0,sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_981,definition,
iPr_def_11 = findmin_cpq_eff(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_982,definition,
iPr_def_12 = removemin_cpq_res(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_983,definition,
iPr_def_13 = remove_cpq(iPr_def_11,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_984,negated_conjecture,
~ check_cpq(iPr_def_10),
inference(demodulation,[status(thm)],[c_98,c_980]) ).
tcf(c_985,negated_conjecture,
ok(iPr_def_13),
inference(demodulation,[status(thm)],[c_97,c_982,c_981,c_983]) ).
tcf(c_986,negated_conjecture,
check_cpq(iPr_def_13),
inference(demodulation,[status(thm)],[c_96]) ).
tcf(c_2391,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ check_cpq(remove_cpq(findmin_cpq_eff(iPr_def_10),removemin_cpq_res(iPr_def_10)))
| ~ ok(remove_cpq(findmin_cpq_eff(triple(sK0,sK1,sK2)),removemin_cpq_res(triple(sK0,sK1,sK2)))) ),
inference(superposition,[status(thm)],[c_980,c_95]) ).
tcf(c_2392,plain,
( check_cpq(iPr_def_10)
| ~ ok(iPr_def_13)
| ~ check_cpq(iPr_def_13) ),
inference(light_normalisation,[status(thm)],[c_2391,c_980,c_981,c_982,c_983]) ).
tcf(c_2393,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2392,c_984,c_985,c_986]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV389+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.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 19:29:54 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.88/1.29 % SZS status Started for theBenchmark.p
% 1.88/1.29 % SZS status Theorem for theBenchmark.p
% 1.88/1.29
% 1.88/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.88/1.29
% 1.88/1.29 % ------ iProver source info
% 1.88/1.29
% 1.88/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.88/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.88/1.29 % git: non_committed_changes: false
% 1.88/1.29
% 1.88/1.29 % ------ Parsing...
% 1.88/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.88/1.29
% 1.88/1.29 % ------ 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.88/1.29
% 1.88/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.88/1.29
% 1.88/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.88/1.29 % ------ Proving...
% 1.88/1.29 % ------ Problem Properties
% 1.88/1.29
% 1.88/1.29 %
% 1.88/1.29 % clauses 47
% 1.88/1.29 % conjectures 3
% 1.88/1.29 % EPR 9
% 1.88/1.29 % Horn 33
% 1.88/1.29 % unary 22
% 1.88/1.29 % binary 12
% 1.88/1.29 % lits 86
% 1.88/1.29 % lits eq 32
% 1.88/1.29 % fd_pure 0
% 1.88/1.29 % fd_pseudo 0
% 1.88/1.29 % fd_cond 5
% 1.88/1.29 % fd_pseudo_cond 5
% 1.88/1.29 % AC symbols 0
% 1.88/1.29
% 1.88/1.29 % ------ Schedule dynamic 5 is on
% 1.88/1.29
% 1.88/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.88/1.29
% 1.88/1.29
% 1.88/1.29 % ------
% 1.88/1.29 % Current options:
% 1.88/1.29 % ------
% 1.88/1.29
% 1.88/1.29
% 1.88/1.29 %
% 1.88/1.29
% 1.88/1.29 % ------ Proving...
% 1.88/1.29 %
% 1.88/1.29
% 1.88/1.29 % SZS status Theorem for theBenchmark.p
% 1.88/1.29
% 1.88/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.88/1.29
% 1.88/1.29
%------------------------------------------------------------------------------