%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV385+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:31 PM UTC 2026
% Result : Theorem 3.28s 1.32s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 11 unt; 2 def)
% Number of atoms : 86 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 82 ( 44 ~; 28 |; 6 &)
% ( 0 <=>; 4 =>; 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 : 39 ( 0 sgn 33 !; 6 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li1316) ).
fof(f43,axiom,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li2225) ).
fof(f44,conjecture,
! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_co) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ok(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f42]) ).
fof(f85,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f43]) ).
fof(f86,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ),
inference(flattening,[],[f85]) ).
fof(f87,plain,
? [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
& ok(im_succ_cpq(triple(X0,X1,X2)))
& check_cpq(im_succ_cpq(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f45]) ).
fof(f88,plain,
? [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
& ok(im_succ_cpq(triple(X0,X1,X2)))
& check_cpq(im_succ_cpq(triple(X0,X1,X2))) ),
inference(flattening,[],[f87]) ).
fof(f95,plain,
( ( ~ ok(triple(sK0,sK1,sK2))
| ~ check_cpq(triple(sK0,sK1,sK2)) )
& ok(im_succ_cpq(triple(sK0,sK1,sK2)))
& check_cpq(im_succ_cpq(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f88]) ).
fof(f144,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f84]) ).
fof(f145,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f146,plain,
( ~ ok(triple(sK0,sK1,sK2))
| ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f147,plain,
ok(im_succ_cpq(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f95]) ).
fof(f148,plain,
check_cpq(im_succ_cpq(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f95]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] :
( check_cpq(triple(X0,X1,X2))
| ~ ok(im_succ_cpq(triple(X0,X1,X2)))
| ~ check_cpq(im_succ_cpq(triple(X0,X1,X2))) ),
inference(cnf_transformation,[],[f145]) ).
tcf(c_97,negated_conjecture,
check_cpq(im_succ_cpq(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f148]) ).
tcf(c_98,negated_conjecture,
ok(im_succ_cpq(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f147]) ).
tcf(c_99,negated_conjecture,
( ~ ok(triple(sK0,sK1,sK2))
| ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_922,definition,
iPr_def_10 = triple(sK0,sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_923,definition,
iPr_def_11 = im_succ_cpq(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_924,negated_conjecture,
( ~ ok(iPr_def_10)
| ~ check_cpq(iPr_def_10) ),
inference(demodulation,[status(thm)],[c_99,c_922]) ).
tcf(c_925,negated_conjecture,
ok(iPr_def_11),
inference(demodulation,[status(thm)],[c_98,c_923]) ).
tcf(c_926,negated_conjecture,
check_cpq(iPr_def_11),
inference(demodulation,[status(thm)],[c_97]) ).
tcf(c_1599,plain,
( ok(triple(sK0,sK1,sK2))
| ~ ok(im_succ_cpq(iPr_def_10)) ),
inference(superposition,[status(thm)],[c_922,c_95]) ).
tcf(c_1600,plain,
( ok(iPr_def_10)
| ~ ok(iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_1599,c_922,c_923]) ).
tcf(c_1601,plain,
ok(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_1600,c_925]) ).
tcf(c_1604,plain,
~ check_cpq(iPr_def_10),
inference(backward_subsumption_resolution,[status(thm)],[c_924,c_1601]) ).
tcf(c_1993,plain,
( check_cpq(triple(sK0,sK1,sK2))
| ~ ok(im_succ_cpq(iPr_def_10))
| ~ check_cpq(im_succ_cpq(triple(sK0,sK1,sK2))) ),
inference(superposition,[status(thm)],[c_922,c_96]) ).
tcf(c_1994,plain,
( check_cpq(iPr_def_10)
| ~ ok(iPr_def_11)
| ~ check_cpq(iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_1993,c_922,c_923]) ).
tcf(c_1995,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1994,c_1604,c_925,c_926]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV385+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.13/0.38 % Computer : n013.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Thu Sep 24 19:25:36 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/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.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 3.28/1.32 % SZS status Started for theBenchmark.p
% 3.28/1.32 % SZS status Theorem for theBenchmark.p
% 3.28/1.32
% 3.28/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.28/1.32
% 3.28/1.32 % ------ iProver source info
% 3.28/1.32
% 3.28/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.28/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.28/1.32 % git: non_committed_changes: false
% 3.28/1.32
% 3.28/1.32 % ------ Parsing...
% 3.28/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.28/1.32
% 3.28/1.32 % ------ 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.28/1.32
% 3.28/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.28/1.32
% 3.28/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.28/1.32 % ------ Proving...
% 3.28/1.32 % ------ Problem Properties
% 3.28/1.32
% 3.28/1.32 %
% 3.28/1.32 % clauses 46
% 3.28/1.32 % conjectures 3
% 3.28/1.32 % EPR 9
% 3.28/1.32 % Horn 32
% 3.28/1.32 % unary 19
% 3.28/1.32 % binary 14
% 3.28/1.32 % lits 87
% 3.28/1.32 % lits eq 30
% 3.28/1.32 % fd_pure 0
% 3.28/1.32 % fd_pseudo 0
% 3.28/1.32 % fd_cond 5
% 3.28/1.32 % fd_pseudo_cond 5
% 3.28/1.32 % AC symbols 0
% 3.28/1.32
% 3.28/1.32 % ------ Schedule dynamic 5 is on
% 3.28/1.32
% 3.28/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.28/1.32
% 3.28/1.32
% 3.28/1.32 % ------
% 3.28/1.32 % Current options:
% 3.28/1.32 % ------
% 3.28/1.32
% 3.28/1.32
% 3.28/1.32 %
% 3.28/1.32
% 3.28/1.32 % ------ Proving...
% 3.28/1.32 %
% 3.28/1.32
% 3.28/1.32 % SZS status Theorem for theBenchmark.p
% 3.28/1.32
% 3.28/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.28/1.32
% 3.28/1.32
%------------------------------------------------------------------------------