TSTP Solution File: SWW959+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW959+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n011.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 : Mon Jun 24 18:15:44 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% 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(ax165,axiom,
! [X107,X108,X109,X110] :
( ( pred_eq_bitstring_bitstring(name_Nb(X107),constr_adec(X109,name_skB))
& pred_attacker(tuple_client_B_in_5(X109))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X108,name_skB)))
& pred_attacker(tuple_client_B_in_3(X108))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X110,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_2(X110)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',ax165) ).
fof(ax86,axiom,
! [X17,X18] : pred_eq_bitstring_bitstring(X17,X18),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',ax86) ).
fof(ax119,axiom,
! [X61] :
( pred_attacker(X61)
=> pred_attacker(tuple_client_B_in_5(X61)) ),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',ax119) ).
fof(ax121,axiom,
! [X63] :
( pred_attacker(X63)
=> pred_attacker(tuple_client_B_in_3(X63)) ),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',ax121) ).
fof(ax123,axiom,
! [X65] :
( pred_attacker(X65)
=> pred_attacker(tuple_client_B_in_2(X65)) ),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',ax123) ).
fof(ax154,axiom,
! [X98] : pred_attacker(name_new0x2Dname(X98)),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',ax154) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',co0) ).
fof(ax113,axiom,
! [X52] :
( pred_attacker(tuple_client_B_out_6(X52))
=> pred_attacker(X52) ),
file('/export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p',ax113) ).
fof(c_0_8,plain,
! [X222,X223,X224,X225] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X222),constr_adec(X224,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X224))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X223,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X223))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X225,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X225))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax165])])]) ).
fof(c_0_9,plain,
! [X132,X133] : pred_eq_bitstring_bitstring(X132,X133),
inference(variable_rename,[status(thm)],[ax86]) ).
cnf(c_0_10,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X4,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X4)) ),
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,
! [X176] :
( ~ pred_attacker(X176)
| pred_attacker(tuple_client_B_in_5(X176)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax119])])]) ).
cnf(c_0_13,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_attacker(tuple_client_B_in_2(X4)) ),
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,
! [X178] :
( ~ pred_attacker(X178)
| pred_attacker(tuple_client_B_in_3(X178)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax121])])]) ).
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,
! [X180] :
( ~ pred_attacker(X180)
| pred_attacker(tuple_client_B_in_2(X180)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax123])])]) ).
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,
! [X213] : pred_attacker(name_new0x2Dname(X213)),
inference(variable_rename,[status(thm)],[ax154]) ).
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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
fof(c_0_26,plain,
! [X167] :
( ~ pred_attacker(tuple_client_B_out_6(X167))
| pred_attacker(X167) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax113])])]) ).
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_nnf,[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.03/0.13 % Problem : SWW959+1 : TPTP v8.2.0. Released v7.4.0.
% 0.03/0.13 % Command : run_E %s %d SAT
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jun 19 07:40:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.EDmANzIPGg/E---3.1_11962.p
% 0.22/0.53 # Version: 3.2.0
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12061 completed with status 0
% 0.22/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.53 # Starting sh5l with 136s (1) cores
% 0.22/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12070 completed with status 0
% 0.22/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.53 # No SInE strategy applied
% 0.22/0.53 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.53 # Preprocessing time : 0.002 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 169
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 169
% 0.22/0.53 # Removed in clause preprocessing : 1
% 0.22/0.53 # Initial clauses in saturation : 168
% 0.22/0.53 # Processed clauses : 353
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 6
% 0.22/0.53 # ...remaining for further processing : 347
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 5
% 0.22/0.53 # Backward-rewritten : 1
% 0.22/0.53 # Generated clauses : 208
% 0.22/0.53 # ...of the previous two non-redundant : 177
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 208
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 5
% 0.22/0.53 # ...of those cached : 1
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 173
% 0.22/0.53 # Positive orientable unit clauses : 32
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 79
% 0.22/0.53 # Non-unit-clauses : 62
% 0.22/0.53 # Current number of unprocessed clauses: 141
% 0.22/0.53 # ...number of literals in the above : 418
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 175
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 4890
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 4672
% 0.22/0.53 # Non-unit clause-clause subsumptions : 11
% 0.22/0.53 # Unit Clause-clause subsumption calls : 1864
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 1
% 0.22/0.53 # BW rewrite match successes : 1
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 9262
% 0.22/0.53 # Search garbage collected termcells : 1159
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.014 s
% 0.22/0.53 # System time : 0.007 s
% 0.22/0.53 # Total time : 0.021 s
% 0.22/0.53 # Maximum resident set size: 2228 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.072 s
% 0.22/0.53 # System time : 0.014 s
% 0.22/0.53 # Total time : 0.086 s
% 0.22/0.53 # Maximum resident set size: 1876 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E exiting
%------------------------------------------------------------------------------