%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWW962+1 : TPTP v9.2.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:33:28 PM UTC 2026
% Result : Theorem 1.33s 1.74s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 24 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 7 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax83,axiom,
! [X12,X13] : constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X12,X13)) = X13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(ax82,axiom,
! [X9,X10,X11] : tuple_assoc_pair(X9,tuple_assoc_pair(X10,X11)) = tuple_assoc_pair(tuple_assoc_pair(X9,X10),X11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(ax143,axiom,
! [X94,X95] :
( pred_attacker(tuple_assoc_pair(X94,X95))
=> pred_attacker(X94) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax143) ).
fof(co0,conjecture,
! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax162,axiom,
! [X113] : pred_attacker(name_new0x2Dname(X113)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax162) ).
fof(c_0_5,plain,
! [X274,X275] : constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X274,X275)) = X275,
inference(variable_rename,[status(thm)],[ax83]) ).
fof(c_0_6,plain,
! [X271,X272,X273] : tuple_assoc_pair(X271,tuple_assoc_pair(X272,X273)) = tuple_assoc_pair(tuple_assoc_pair(X271,X272),X273),
inference(variable_rename,[status(thm)],[ax82]) ).
fof(c_0_7,plain,
! [X356,X357] :
( ~ pred_attacker(tuple_assoc_pair(X356,X357))
| pred_attacker(X356) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax143])]) ).
cnf(c_0_8,plain,
constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3)) = tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
~ ! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_11,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_assoc_pair(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
tuple_assoc_pair(X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
fof(c_0_13,plain,
! [X375] : pred_attacker(name_new0x2Dname(X375)),
inference(variable_rename,[status(thm)],[ax162]) ).
fof(c_0_14,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
pred_attacker(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW962+1 : TPTP v9.2.1. Released v7.4.0.
% 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.17/0.34 % Computer : n008.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue May 5 07:36:58 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.35 % start to proof: theBenchmark
% 1.33/1.74 % Version : CSE_E---1.7
% 1.33/1.74 % Problem : theBenchmark.p
% 1.33/1.74 % SZS status Theorem for theBenchmark.p
% 1.33/1.74 % SZS output start CNFRefutation
% See solution above
% 1.33/1.74 % Total time : 1.376s
%------------------------------------------------------------------------------