%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV397+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 : n001.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:32 PM UTC 2026
% Result : Theorem 3.93s 1.52s
% Output : CNFRefutation 3.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 17 unt; 2 def)
% Number of atoms : 42 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 3 |; 2 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn 36 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(f31,axiom,
! [X0,X1,X2,X3] :
( ~ contains_slb(X1,X3)
=> remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax43) ).
fof(f42,conjecture,
! [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
=> contains_slb(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l33_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
=> contains_slb(X1,X3) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f70,plain,
! [X0,X1,X2,X3] :
( contains_slb(X1,X3)
| remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad) ),
inference(ennf_transformation,[],[f31]) ).
fof(f82,plain,
? [X0,X1,X2,X3] :
( ok(remove_cpq(triple(X0,X1,X2),X3))
& ~ contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
( ok(remove_cpq(triple(sK0,sK1,sK2),sK3))
& ~ contains_slb(sK1,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f82]) ).
fof(f124,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f127,plain,
! [X2,X3,X0,X1] :
( contains_slb(X1,X3)
| triple(X0,X1,bad) = remove_cpq(triple(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f70]) ).
fof(f138,plain,
ok(remove_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f89]) ).
fof(f139,plain,
~ contains_slb(sK1,sK3),
inference(cnf_transformation,[],[f89]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f124]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( contains_slb(X1,X3)
| ( remove_cpq(triple(X0,X1,X2),X3) = triple(X0,X1,bad) ) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_95,negated_conjecture,
~ contains_slb(sK1,sK3),
inference(cnf_transformation,[],[f139]) ).
tcf(c_96,negated_conjecture,
ok(remove_cpq(triple(sK0,sK1,sK2),sK3)),
inference(cnf_transformation,[],[f138]) ).
tcf(c_890,definition,
iPr_def_10 = triple(sK0,sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_891,definition,
iPr_def_11 = remove_cpq(iPr_def_10,sK3),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_892,negated_conjecture,
ok(iPr_def_11),
inference(demodulation,[status(thm)],[c_96,c_890,c_891]) ).
tcf(c_893,negated_conjecture,
~ contains_slb(sK1,sK3),
inference(demodulation,[status(thm)],[c_95]) ).
tcf(c_1720,plain,
! [X0: $i,X1: $i] : remove_cpq(triple(X0,sK1,X1),sK3) = triple(X0,sK1,bad),
inference(superposition,[status(thm)],[c_86,c_893]) ).
tcf(c_1750,plain,
triple(sK0,sK1,bad) = remove_cpq(iPr_def_10,sK3),
inference(superposition,[status(thm)],[c_890,c_1720]) ).
tcf(c_1751,plain,
triple(sK0,sK1,bad) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_1750,c_891]) ).
tcf(c_1759,plain,
~ ok(iPr_def_11),
inference(superposition,[status(thm)],[c_1751,c_83]) ).
tcf(c_1764,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1759,c_892]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV397+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.46 % Computer : n001.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Thu Sep 24 19:34:08 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.24/0.54
% 0.24/0.54 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.54
% 0.24/0.54 % Detected problem language: tptp
% 0.24/0.55 % Proving...
% 3.93/1.52 % SZS status Started for theBenchmark.p
% 3.93/1.52 % SZS status Theorem for theBenchmark.p
% 3.93/1.52
% 3.93/1.52 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.93/1.52
% 3.93/1.52 % ------ iProver source info
% 3.93/1.52
% 3.93/1.52 % git: date: 2026-07-19 20:42:38 +0200
% 3.93/1.52 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.93/1.52 % git: non_committed_changes: false
% 3.93/1.52
% 3.93/1.52 % ------ Parsing...
% 3.93/1.52 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.93/1.52
% 3.93/1.52 % ------ 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.93/1.52
% 3.93/1.52 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.93/1.52
% 3.93/1.52 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.93/1.52 % ------ Proving...
% 3.93/1.52 % ------ Problem Properties
% 3.93/1.52
% 3.93/1.52 %
% 3.93/1.52 % clauses 43
% 3.93/1.52 % conjectures 2
% 3.93/1.52 % EPR 8
% 3.93/1.52 % Horn 29
% 3.93/1.52 % unary 19
% 3.93/1.52 % binary 12
% 3.93/1.52 % lits 80
% 3.93/1.52 % lits eq 30
% 3.93/1.52 % fd_pure 0
% 3.93/1.52 % fd_pseudo 0
% 3.93/1.52 % fd_cond 5
% 3.93/1.52 % fd_pseudo_cond 5
% 3.93/1.52 % AC symbols 0
% 3.93/1.52
% 3.93/1.52 % ------ Schedule dynamic 5 is on
% 3.93/1.52
% 3.93/1.52 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.93/1.52
% 3.93/1.52
% 3.93/1.52 % ------
% 3.93/1.52 % Current options:
% 3.93/1.52 % ------
% 3.93/1.52
% 3.93/1.52
% 3.93/1.52 %
% 3.93/1.52
% 3.93/1.52 % ------ Proving...
% 3.93/1.52 %
% 3.93/1.52
% 3.93/1.52 % SZS status Theorem for theBenchmark.p
% 3.93/1.52
% 3.93/1.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.93/1.52
% 3.93/1.52
%------------------------------------------------------------------------------