%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW962+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.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:30:35 PM UTC 2026
% Result : Theorem 3.49s 1.28s
% Output : CNFRefutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 22 unt; 2 def)
% Number of atoms : 36 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 33 !; 1 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [X0,X1,X2] : tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)) = tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(f86,axiom,
! [X0,X1] : constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax85) ).
fof(f93,axiom,
pred_attacker(tuple_true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax92) ).
fof(f144,axiom,
! [X0,X1] :
( pred_attacker(tuple_assoc_pair(X0,X1))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax143) ).
fof(f177,conjecture,
! [X0] : pred_attacker(tuple_2(name_Nb(X0),name_objective)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f178,negated_conjecture,
~ ! [X0] : pred_attacker(tuple_2(name_Nb(X0),name_objective)),
inference(negated_conjecture,[status(cth)],[f177]) ).
fof(f240,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_assoc_pair(X0,X1))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f144]) ).
fof(f266,plain,
? [X0] : ~ pred_attacker(tuple_2(name_Nb(X0),name_objective)),
inference(ennf_transformation,[],[f178]) ).
fof(f267,plain,
~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f266]) ).
fof(f350,plain,
! [X2,X0,X1] : tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)) = tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2),
inference(cnf_transformation,[],[f83]) ).
fof(f353,plain,
! [X0,X1] : constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,X1)) = X1,
inference(cnf_transformation,[],[f86]) ).
fof(f360,plain,
pred_attacker(tuple_true),
inference(cnf_transformation,[],[f93]) ).
fof(f411,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_assoc_pair(X0,X1))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f240]) ).
fof(f443,plain,
~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
inference(cnf_transformation,[],[f267]) ).
tcf(c_131,plain,
! [X0: $i,X1: $i,X2: $i] : tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2) = tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)),
inference(cnf_transformation,[],[f350]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] : constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,X1)) = X1,
inference(cnf_transformation,[],[f353]) ).
tcf(c_141,plain,
pred_attacker(tuple_true),
inference(cnf_transformation,[],[f360]) ).
tcf(c_192,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_assoc_pair(X0,X1)) ),
inference(cnf_transformation,[],[f411]) ).
tcf(c_224,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
inference(cnf_transformation,[],[f443]) ).
tcf(c_2789,definition,
iPr_def_10 = name_Nb(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2790,definition,
iPr_def_11 = tuple_2(iPr_def_10,name_objective),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2791,negated_conjecture,
~ pred_attacker(iPr_def_11),
inference(demodulation,[status(thm)],[c_224,c_2789,c_2790]) ).
tcf(c_5538,plain,
! [X0: $i,X1: $i,X2: $i] : constr_assoc_pair_2_get_1(tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2))) = X2,
inference(superposition,[status(thm)],[c_131,c_134]) ).
tcf(c_5567,plain,
! [X0: $i,X1: $i] : tuple_assoc_pair(X0,X1) = X1,
inference(demodulation,[status(thm)],[c_5538,c_134]) ).
tcf(c_5572,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(demodulation,[status(thm)],[c_192,c_5567]) ).
tcf(c_5631,plain,
! [X0: $i] : pred_attacker(X0),
inference(superposition,[status(thm)],[c_141,c_5572]) ).
tcf(c_5653,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_2791,c_5631]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW962+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n014.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 23:16:17 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.49/1.28 % SZS status Started for theBenchmark.p
% 3.49/1.28 % SZS status Theorem for theBenchmark.p
% 3.49/1.28
% 3.49/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.49/1.28
% 3.49/1.28 % ------ iProver source info
% 3.49/1.28
% 3.49/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.49/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.49/1.28 % git: non_committed_changes: false
% 3.49/1.28
% 3.49/1.28 % ------ Parsing...
% 3.49/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.49/1.28
% 3.49/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.49/1.28
% 3.49/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.49/1.28
% 3.49/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.49/1.28 % ------ Proving...
% 3.49/1.28 % ------ Problem Properties
% 3.49/1.28
% 3.49/1.28 %
% 3.49/1.28 % clauses 175
% 3.49/1.28 % conjectures 1
% 3.49/1.28 % EPR 90
% 3.49/1.28 % Horn 174
% 3.49/1.28 % unary 112
% 3.49/1.28 % binary 47
% 3.49/1.28 % lits 255
% 3.49/1.28 % lits eq 93
% 3.49/1.28 % fd_pure 0
% 3.49/1.28 % fd_pseudo 0
% 3.49/1.28 % fd_cond 1
% 3.49/1.28 % fd_pseudo_cond 0
% 3.49/1.28 % AC symbols 0
% 3.49/1.28
% 3.49/1.28 % ------ Schedule dynamic 5 is on
% 3.49/1.28
% 3.49/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.49/1.28
% 3.49/1.28
% 3.49/1.28 % ------
% 3.49/1.28 % Current options:
% 3.49/1.28 % ------
% 3.49/1.28
% 3.49/1.28
% 3.49/1.28 %
% 3.49/1.28
% 3.49/1.28 % ------ Proving...
% 3.49/1.28 %
% 3.49/1.28
% 3.49/1.28 % SZS status Theorem for theBenchmark.p
% 3.49/1.28
% 3.49/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.49/1.28
% 3.49/1.28
%------------------------------------------------------------------------------