TSTP Solution File: SWW965+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : 600s
% DateTime : Thu Jul 21 00:11:46 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 83 ( 38 ~; 35 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 19 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax184,axiom,
! [X116,X117,X118,X119] :
( ( pred_eq_bitstring_bitstring(name_Nb(X116),constr_adec(X118,name_skB))
& pred_attacker(tuple_client_B_in_5(X118))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X117,name_skB)))
& pred_attacker(tuple_client_B_in_3(X117))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X119,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_2(X119)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax184) ).
fof(ax103,axiom,
! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax103) ).
fof(ax137,axiom,
! [X70] :
( pred_attacker(X70)
=> pred_attacker(tuple_client_B_in_5(X70)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax137) ).
fof(ax139,axiom,
! [X72] :
( pred_attacker(X72)
=> pred_attacker(tuple_client_B_in_3(X72)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax139) ).
fof(ax141,axiom,
! [X74] :
( pred_attacker(X74)
=> pred_attacker(tuple_client_B_in_2(X74)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax141) ).
fof(ax173,axiom,
! [X107] : pred_attacker(name_new0x2Dname(X107)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax173) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).
fof(ax131,axiom,
! [X61] :
( pred_attacker(tuple_client_B_out_6(X61))
=> pred_attacker(X61) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax131) ).
fof(c_0_8,plain,
! [X120,X121,X122,X123] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X120),constr_adec(X122,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X122))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X121,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X121))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X123,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X123))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax184])])])]) ).
fof(c_0_9,plain,
! [X26,X27] : pred_eq_bitstring_bitstring(X26,X27),
inference(variable_rename,[status(thm)],[ax103]) ).
cnf(c_0_10,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X1,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_3(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X2,name_skB)))
| ~ pred_attacker(tuple_client_B_in_5(X3))
| ~ pred_eq_bitstring_bitstring(name_Nb(X4),constr_adec(X3,name_skB)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X71] :
( ~ pred_attacker(X71)
| pred_attacker(tuple_client_B_in_5(X71)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax137])]) ).
cnf(c_0_13,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_5(X3))
| ~ pred_attacker(tuple_client_B_in_3(X2))
| ~ pred_attacker(tuple_client_B_in_2(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).
cnf(c_0_14,plain,
( pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X73] :
( ~ pred_attacker(X73)
| pred_attacker(tuple_client_B_in_3(X73)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(tuple_client_B_in_2(X2))
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X75] :
( ~ pred_attacker(X75)
| pred_attacker(tuple_client_B_in_2(X75)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X108] : pred_attacker(name_new0x2Dname(X108)),
inference(variable_rename,[status(thm)],[ax173]) ).
cnf(c_0_22,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_25,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
fof(c_0_26,plain,
! [X62] :
( ~ pred_attacker(tuple_client_B_out_6(X62))
| pred_attacker(X62) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax131])]) ).
cnf(c_0_27,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
fof(c_0_28,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_B_out_6(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 6 08:13:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.016 s
% 0.24/1.41
% 0.24/1.41 # Failure: Out of unprocessed clauses!
% 0.24/1.41 # OLD status GaveUp
% 0.24/1.41 # Parsed axioms : 188
% 0.24/1.41 # Removed by relevancy pruning/SinE : 87
% 0.24/1.41 # Initial clauses : 101
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 101
% 0.24/1.41 # Processed clauses : 101
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 101
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 0
% 0.24/1.41 # ...of the previous two non-trivial : 0
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 0
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 101
% 0.24/1.41 # Positive orientable unit clauses : 10
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 91
% 0.24/1.41 # Non-unit-clauses : 0
% 0.24/1.41 # Current number of unprocessed clauses: 0
% 0.24/1.41 # ...number of literals in the above : 0
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 3
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 1802
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.016 s
% 0.24/1.41 # System time : 0.001 s
% 0.24/1.41 # Total time : 0.017 s
% 0.24/1.41 # Maximum resident set size: 3272 pages
% 0.24/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41 # Preprocessing time : 0.019 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 33
% 0.24/1.41 # Proof object clause steps : 16
% 0.24/1.41 # Proof object formula steps : 17
% 0.24/1.41 # Proof object conjectures : 4
% 0.24/1.41 # Proof object clause conjectures : 1
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 8
% 0.24/1.41 # Proof object initial formulas used : 8
% 0.24/1.41 # Proof object generating inferences : 7
% 0.24/1.41 # Proof object simplifying inferences : 5
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 188
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 188
% 0.24/1.41 # Removed in clause preprocessing : 1
% 0.24/1.41 # Initial clauses in saturation : 187
% 0.24/1.41 # Processed clauses : 202
% 0.24/1.41 # ...of these trivial : 1
% 0.24/1.41 # ...subsumed : 3
% 0.24/1.41 # ...remaining for further processing : 198
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 5
% 0.24/1.41 # Backward-rewritten : 1
% 0.24/1.41 # Generated clauses : 240
% 0.24/1.41 # ...of the previous two non-trivial : 200
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 240
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 192
% 0.24/1.41 # Positive orientable unit clauses : 37
% 0.24/1.41 # Positive unorientable unit clauses: 1
% 0.24/1.41 # Negative unit clauses : 92
% 0.24/1.41 # Non-unit-clauses : 62
% 0.24/1.41 # Current number of unprocessed clauses: 24
% 0.24/1.41 # ...number of literals in the above : 54
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 7
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 2864
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 2731
% 0.24/1.41 # Non-unit clause-clause subsumptions : 8
% 0.24/1.41 # Unit Clause-clause subsumption calls : 1532
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 6
% 0.24/1.41 # BW rewrite match successes : 5
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 8364
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.027 s
% 0.24/1.41 # System time : 0.000 s
% 0.24/1.41 # Total time : 0.027 s
% 0.24/1.41 # Maximum resident set size: 3764 pages
%------------------------------------------------------------------------------