%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW955+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n003.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:34 PM UTC 2026
% Result : Theorem 2.59s 6.27s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 60 ( 23 unt; 0 def)
% Number of atoms : 103 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 83 ( 40 ~; 35 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 54 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f47,axiom,
! [X0,X1] : constr_comm_dec(constr_comm_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(f48,axiom,
pred_attacker(tuple_true),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax47) ).
fof(f51,axiom,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(constr_dec(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax50) ).
fof(f66,axiom,
! [X0] :
( pred_attacker(tuple_A_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f68,axiom,
! [X0] :
( pred_attacker(tuple_A_out_3(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
fof(f70,axiom,
! [X0] :
( pred_attacker(tuple_A_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f71,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_A_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).
fof(f78,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax77) ).
fof(f79,axiom,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f80,axiom,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax79) ).
fof(f82,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f83,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f82]) ).
fof(f84,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f83]) ).
fof(f88,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_dec(X0,X1)) ),
inference(ennf_transformation,[],[f51]) ).
fof(f89,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_dec(X0,X1)) ),
inference(flattening,[],[f88]) ).
fof(f101,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_4(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f66]) ).
fof(f103,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_3(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f105,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_1(X0))
| pred_attacker(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f106,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_in_2(X0)) ),
inference(ennf_transformation,[],[f71]) ).
fof(f112,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_2(X0))
| pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
inference(ennf_transformation,[],[f79]) ).
fof(f113,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_2(X0))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(ennf_transformation,[],[f80]) ).
fof(f160,plain,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f46]) ).
fof(f161,plain,
! [X0,X1] : constr_comm_dec(constr_comm_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f47]) ).
fof(f162,plain,
pred_attacker(tuple_true),
inference(cnf_transformation,[],[f48]) ).
fof(f165,plain,
! [X0,X1] :
( ~ pred_attacker(X1)
| ~ pred_attacker(X0)
| pred_attacker(constr_dec(X0,X1)) ),
inference(cnf_transformation,[],[f89]) ).
fof(f180,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f182,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_3(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f184,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f185,plain,
! [X0] :
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f106]) ).
fof(f191,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(cnf_transformation,[],[f78]) ).
fof(f192,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_2(X0))
| pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
inference(cnf_transformation,[],[f112]) ).
fof(f193,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_2(X0))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f195,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f84]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i] : constr_dec(constr_enc(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f160]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] : constr_comm_dec(constr_comm_enc(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f161]) ).
tcf(c_96,plain,
pred_attacker(tuple_true),
inference(cnf_transformation,[],[f162]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( pred_attacker(constr_dec(X1,X0))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_114,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_4(X0)) ),
inference(cnf_transformation,[],[f180]) ).
tcf(c_116,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_3(X0)) ),
inference(cnf_transformation,[],[f182]) ).
tcf(c_118,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_1(X0)) ),
inference(cnf_transformation,[],[f184]) ).
tcf(c_119,plain,
! [X0: $i] :
( pred_attacker(tuple_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_125,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(cnf_transformation,[],[f191]) ).
tcf(c_126,plain,
! [X0: $i] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_127,plain,
! [X0: $i] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_129,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f195]) ).
tcf(c_183,plain,
! [X0: $i] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka)))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_119,c_126]) ).
tcf(c_185,plain,
! [X0: $i] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_119,c_127]) ).
tcf(c_661,plain,
! [X0: $i] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka)))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_183]) ).
tcf(c_663,plain,
! [X0: $i] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(X0) ),
inference(prop_impl_just,[status(thm)],[c_185]) ).
tcf(c_1079,negated_conjecture,
~ pred_attacker(name_objective),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_1969,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(superposition,[status(thm)],[c_96,c_663]) ).
tcf(c_2023,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(superposition,[status(thm)],[c_1969,c_114]) ).
tcf(c_2033,plain,
! [X0: $i] :
( pred_attacker(constr_comm_dec(X0,name_Ka))
| ~ pred_attacker(X0) ),
inference(superposition,[status(thm)],[c_661,c_116]) ).
tcf(c_2045,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(superposition,[status(thm)],[c_125,c_118]) ).
tcf(c_2075,plain,
! [X0: $i,X1: $i] :
( pred_attacker(X0)
| ~ pred_attacker(X1)
| ~ pred_attacker(constr_enc(X0,X1)) ),
inference(superposition,[status(thm)],[c_94,c_99]) ).
tcf(c_2083,plain,
! [X0: $i] :
( pred_attacker(X0)
| ~ pred_attacker(constr_comm_enc(X0,name_Ka)) ),
inference(superposition,[status(thm)],[c_95,c_2033]) ).
tcf(c_2091,plain,
pred_attacker(name_m_9),
inference(superposition,[status(thm)],[c_2045,c_2083]) ).
tcf(c_2128,plain,
( pred_attacker(name_objective)
| ~ pred_attacker(name_m_9) ),
inference(superposition,[status(thm)],[c_2023,c_2075]) ).
tcf(c_2129,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2128,c_1079,c_2091]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW955+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/5.36 % Computer : n003.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Thu Sep 24 23:17:27 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/5.40 Running first-order theorem proving
% 0.08/5.40 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/5.41
% 0.13/5.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.41
% 0.13/5.41 % Detected problem language: tptp
% 0.13/5.42 % Proving...
% 2.59/6.27 % SZS status Started for theBenchmark.p
% 2.59/6.27 % SZS status Theorem for theBenchmark.p
% 2.59/6.27
% 2.59/6.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.59/6.27
% 2.59/6.27 % ------ iProver source info
% 2.59/6.27
% 2.59/6.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.59/6.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.59/6.27 % git: non_committed_changes: false
% 2.59/6.27
% 2.59/6.27 % ------ Parsing...
% 2.59/6.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.59/6.27
% 2.59/6.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.59/6.27
% 2.59/6.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.59/6.27
% 2.59/6.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.59/6.27 % ------ Proving...
% 2.59/6.27 % ------ Problem Properties
% 2.59/6.27
% 2.59/6.27 %
% 2.59/6.27 % clauses 79
% 2.59/6.27 % conjectures 1
% 2.59/6.27 % EPR 54
% 2.59/6.27 % Horn 79
% 2.59/6.27 % unary 58
% 2.59/6.27 % binary 17
% 2.59/6.27 % lits 104
% 2.59/6.27 % lits eq 47
% 2.59/6.27 % fd_pure 0
% 2.59/6.27 % fd_pseudo 0
% 2.59/6.27 % fd_cond 0
% 2.59/6.27 % fd_pseudo_cond 0
% 2.59/6.27 % AC symbols 0
% 2.59/6.27
% 2.59/6.27 % ------ Schedule dynamic 5 is on
% 2.59/6.27
% 2.59/6.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.59/6.27
% 2.59/6.27
% 2.59/6.27 % ------
% 2.59/6.27 % Current options:
% 2.59/6.27 % ------
% 2.59/6.27
% 2.59/6.27
% 2.59/6.27 %
% 2.59/6.27
% 2.59/6.27 % ------ Proving...
% 2.59/6.27 %
% 2.59/6.27
% 2.59/6.27 % SZS status Theorem for theBenchmark.p
% 2.59/6.27
% 2.59/6.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.59/6.27
% 2.59/6.27
%------------------------------------------------------------------------------