%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWW962+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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 : Sun Sep 27 09:14:57 AM UTC 2026
% Result : Theorem 0.70s 0.51s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 16 unt; 0 def)
% Number of atoms : 30 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 5 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 8 sgn 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax82,axiom,
! [VAR_X_17,VAR_Y_18,VAR_Z_0X30] : tuple_assoc_pair(VAR_X_17,tuple_assoc_pair(VAR_Y_18,VAR_Z_0X30)) = tuple_assoc_pair(tuple_assoc_pair(VAR_X_17,VAR_Y_18),VAR_Z_0X30),
file('theBenchmark.p',ax82) ).
fof(ax83,axiom,
! [VAR_X0X30_15,VAR_X1_16] : constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(VAR_X0X30_15,VAR_X1_16)) = VAR_X1_16,
file('theBenchmark.p',ax83) ).
fof(ax143,axiom,
! [VAR_V_233,VAR_V_234] :
( pred_attacker(tuple_assoc_pair(VAR_V_233,VAR_V_234))
=> pred_attacker(VAR_V_233) ),
file('theBenchmark.p',ax143) ).
fof(ax152,axiom,
! [VAR_V_253,VAR_V_254] :
( ( pred_attacker(VAR_V_254)
& pred_attacker(VAR_V_253) )
=> pred_attacker(tuple_2(VAR_V_253,VAR_V_254)) ),
file('theBenchmark.p',ax152) ).
fof(co0,conjecture,
! [VAR_V_711] : pred_attacker(tuple_2(name_Nb(VAR_V_711),name_objective)),
file('theBenchmark.p',co0) ).
fof(co0_neg,negated_conjecture,
~ ! [VAR_V_711] : pred_attacker(tuple_2(name_Nb(VAR_V_711),name_objective)),
inference(assume_negation,[status(cth)],[co0]) ).
fof(ax92,axiom,
pred_attacker(tuple_true),
file('theBenchmark.p',ax92) ).
cnf(c_83,plain,
pred_attacker(tuple_true),
inference(clausify,[status(thm)],[ax92]) ).
cnf(c_224,plain,
tuple_assoc_pair(tuple_assoc_pair(A,B),C) = tuple_assoc_pair(A,tuple_assoc_pair(B,C)),
inference(clausify,[status(thm)],[ax82]) ).
cnf(c_225,plain,
constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(A,B)) = B,
inference(clausify,[status(thm)],[ax83]) ).
cnf(c_269,plain,
( pred_attacker(A)
| ~ pred_attacker(tuple_assoc_pair(A,B)) ),
inference(clausify,[status(thm)],[ax143]) ).
cnf(c_278,plain,
( pred_attacker(tuple_2(A,B))
| ~ pred_attacker(B)
| ~ pred_attacker(A) ),
inference(clausify,[status(thm)],[ax152]) ).
fof(nnf_81,plain,
? [VAR_V_711] : ~ pred_attacker(tuple_2(name_Nb(VAR_V_711),name_objective)),
inference(fof_nnf,[status(thm)],[co0_neg]) ).
fof(sk_co0_neg,plain,
~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(VAR_V_711,sK0)],[nnf_81]) ).
cnf(c_298,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
inference(split_conjunct,[status(thm)],[sk_co0_neg]) ).
cnf(c_306,plain,
( pred_attacker(tuple_2(A,A))
| ~ pred_attacker(A) ),
inference(factor,[status(thm)],[c_278]) ).
cnf(c_678,plain,
pred_attacker(tuple_2(tuple_true,tuple_true)),
inference(resolve,[status(thm)],[c_306,c_83]) ).
cnf(c_976,plain,
constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(A,tuple_assoc_pair(B,C))) = C,
inference(paramod,[status(thm)],[c_224,c_225]) ).
cnf(c_938,plain,
tuple_assoc_pair(A,B) = B,
inference(paramod,[status(thm)],[c_225,c_976]) ).
cnf(c_969,plain,
( pred_attacker(B)
| ~ pred_attacker(A) ),
inference(paramod,[status(thm)],[c_938,c_269]) ).
cnf(c_974,plain,
pred_attacker(A),
inference(resolve,[status(thm)],[c_969,c_678]) ).
cnf(c_975,plain,
$false,
inference(resolve,[status(thm)],[c_974,c_298]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW962+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 16:38:44 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 622322 was started by sandbox2 on n009,
% 0.11/0.38 % Sat Sep 26 16:38:44 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.40
% 0.11/0.40 % From the command line: assign(max_seconds, 300).
% 0.11/0.40
% 0.11/0.40 % SInE: 150 to sos, 26 to usable, of 176 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.70/0.51
% 0.70/0.51 % SZS status Theorem for theBenchmark
% 0.70/0.51
% 0.70/0.51 % Proof 1 at 0.06 (+ 0.03) seconds.
% 0.70/0.51 % Length of proof is 17.
% 0.70/0.51 % Level of proof is 5.
% 0.70/0.51 % Maximum clause weight is 221.000.
% 0.70/0.51 % Given clauses 154.
% 0.70/0.51
% 0.70/0.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------