%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV386+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:31 PM UTC 2026
% Result : Theorem 3.58s 2.13s
% Output : CNFRefutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 11 unt; 2 def)
% Number of atoms : 45 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 35 ( 21 ~; 7 |; 4 &)
% ( 0 <=>; 3 =>; 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 31 ( 0 sgn 27 !; 4 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3] : ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l22_l26) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3] :
( ~ ok(insert_cpq(triple(X0,X1,X2),X3))
| ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l22_co) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3] :
( ~ ok(insert_cpq(triple(X0,X1,X2),X3))
| ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ) ),
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f83,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ! [X3] : ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
inference(ennf_transformation,[],[f42]) ).
fof(f84,plain,
? [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
& ? [X3] :
( ok(insert_cpq(triple(X0,X1,X2),X3))
& check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ) ),
inference(ennf_transformation,[],[f44]) ).
fof(f91,plain,
( ~ check_cpq(triple(sK0,sK1,sK2))
& ok(insert_cpq(triple(sK0,sK1,sK2),sK3))
& check_cpq(insert_cpq(triple(sK0,sK1,sK2),sK3)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f84]) ).
fof(f140,plain,
! [X2,X3,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
inference(cnf_transformation,[],[f83]) ).
fof(f141,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f91]) ).
fof(f143,plain,
check_cpq(insert_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f91]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_96,negated_conjecture,
check_cpq(insert_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f143]) ).
tcf(c_98,negated_conjecture,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f141]) ).
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 = insert_cpq(iPr_def_10,sK3),
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_1693,plain,
! [X0: $i] :
( check_cpq(triple(sK0,sK1,sK2))
| ~ check_cpq(insert_cpq(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_912,c_95]) ).
tcf(c_1694,plain,
! [X0: $i] :
( check_cpq(iPr_def_10)
| ~ check_cpq(insert_cpq(iPr_def_10,X0)) ),
inference(light_normalisation,[status(thm)],[c_1693,c_912]) ).
tcf(c_1695,plain,
! [X0: $i] : ~ check_cpq(insert_cpq(iPr_def_10,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_1694,c_914]) ).
tcf(c_1747,plain,
~ check_cpq(iPr_def_11),
inference(superposition,[status(thm)],[c_913,c_1695]) ).
tcf(c_1748,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1747,c_916]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV386+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/1.05 % Computer : n013.cluster.edu
% 0.17/1.05 % Model : x86_64 x86_64
% 0.17/1.05 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/1.05 % Memory : 8046.5625MB
% 0.17/1.05 % OS : Linux 6.8.0-71-generic
% 0.17/1.05 % CPULimit : 300
% 0.17/1.06 % WCLimit : 300
% 0.17/1.06 % DateTime : Thu Sep 24 19:26:22 UTC 2026
% 0.17/1.06 % CPUTime :
% 0.17/1.06 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/1.12 Running first-order theorem proving
% 0.17/1.12 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/1.14
% 0.17/1.14 % ======== iProver multi-core TPTP/SMT =========
% 0.17/1.14
% 0.17/1.14 % Detected problem language: tptp
% 0.19/1.16 % Proving...
% 3.58/2.13 % SZS status Started for theBenchmark.p
% 3.58/2.13 % SZS status Theorem for theBenchmark.p
% 3.58/2.13
% 3.58/2.13 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.58/2.13
% 3.58/2.13 % ------ iProver source info
% 3.58/2.13
% 3.58/2.13 % git: date: 2026-07-19 20:42:38 +0200
% 3.58/2.13 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.58/2.13 % git: non_committed_changes: false
% 3.58/2.13
% 3.58/2.13 % ------ Parsing...
% 3.58/2.13 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.58/2.13
% 3.58/2.13 % ------ 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 %
% 3.58/2.13
% 3.58/2.13 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.58/2.13
% 3.58/2.13 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.58/2.13 % ------ Proving...
% 3.58/2.13 % ------ Problem Properties
% 3.58/2.13
% 3.58/2.13 %
% 3.58/2.13 % clauses 45
% 3.58/2.13 % conjectures 3
% 3.58/2.13 % EPR 9
% 3.58/2.13 % Horn 31
% 3.58/2.13 % unary 20
% 3.58/2.13 % binary 13
% 3.58/2.13 % lits 83
% 3.58/2.13 % lits eq 30
% 3.58/2.13 % fd_pure 0
% 3.58/2.13 % fd_pseudo 0
% 3.58/2.13 % fd_cond 5
% 3.58/2.13 % fd_pseudo_cond 5
% 3.58/2.13 % AC symbols 0
% 3.58/2.13
% 3.58/2.13 % ------ Schedule dynamic 5 is on
% 3.58/2.13
% 3.58/2.13 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.58/2.13
% 3.58/2.13
% 3.58/2.13 % ------
% 3.58/2.13 % Current options:
% 3.58/2.13 % ------
% 3.58/2.13
% 3.58/2.13
% 3.58/2.13 %
% 3.58/2.13
% 3.58/2.13 % ------ Proving...
% 3.58/2.13 %
% 3.58/2.13
% 3.58/2.13 % SZS status Theorem for theBenchmark.p
% 3.58/2.13
% 3.58/2.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.58/2.13
% 3.58/2.13
%------------------------------------------------------------------------------