TSTP Solution File: SWW963+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SWW963+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:13:10 EDT 2024
% Result : Theorem 0.63s 0.56s
% Output : CNFRefutation 0.63s
% 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 : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 19 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax192,axiom,
! [X193,X194,X195,X196] :
( ( pred_eq_bitstring_bitstring(name_Nb(X193),constr_ecb_dec_1(X195,name_skB))
& pred_attacker(tuple_client_B_in_5(X195))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X194,name_skB)))
& pred_attacker(tuple_client_B_in_3(X194))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X196,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_2(X196)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',ax192) ).
fof(ax95,axiom,
! [X50,X51] : pred_eq_bitstring_bitstring(X50,X51),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',ax95) ).
fof(ax139,axiom,
! [X119] :
( pred_attacker(X119)
=> pred_attacker(tuple_client_B_in_5(X119)) ),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',ax139) ).
fof(ax141,axiom,
! [X121] :
( pred_attacker(X121)
=> pred_attacker(tuple_client_B_in_3(X121)) ),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',ax141) ).
fof(ax143,axiom,
! [X123] :
( pred_attacker(X123)
=> pred_attacker(tuple_client_B_in_2(X123)) ),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',ax143) ).
fof(ax181,axiom,
! [X184] : pred_attacker(name_new0x2Dname(X184)),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',ax181) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',co0) ).
fof(ax133,axiom,
! [X110] :
( pred_attacker(tuple_client_B_out_6(X110))
=> pred_attacker(X110) ),
file('/export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p',ax133) ).
fof(c_0_8,plain,
! [X394,X395,X396,X397] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X394),constr_ecb_dec_1(X396,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X396))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(X395,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X395))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X397,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X397))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax192])])]) ).
fof(c_0_9,plain,
! [X251,X252] : pred_eq_bitstring_bitstring(X251,X252),
inference(variable_rename,[status(thm)],[ax95]) ).
cnf(c_0_10,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_ecb_dec_1(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_ecb_dec_2(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,
! [X320] :
( ~ pred_attacker(X320)
| pred_attacker(tuple_client_B_in_5(X320)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])])]) ).
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,
! [X322] :
( ~ pred_attacker(X322)
| pred_attacker(tuple_client_B_in_3(X322)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])])]) ).
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,
! [X324] :
( ~ pred_attacker(X324)
| pred_attacker(tuple_client_B_in_2(X324)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax143])])]) ).
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,
! [X385] : pred_attacker(name_new0x2Dname(X385)),
inference(variable_rename,[status(thm)],[ax181]) ).
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,
! [X311] :
( ~ pred_attacker(tuple_client_B_out_6(X311))
| pred_attacker(X311) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax133])])]) ).
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.07/0.13 % Problem : SWW963+1 : TPTP v8.2.0. Released v7.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 04:19:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.0WpKJAzDFL/E---3.1_3613.p
% 0.63/0.56 # Version: 3.2.0
% 0.63/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.63/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.63/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.63/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.63/0.56 # Starting sh5l with 300s (1) cores
% 0.63/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3711 completed with status 0
% 0.63/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.63/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.63/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.63/0.56 # No SInE strategy applied
% 0.63/0.56 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.63/0.56 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.63/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 450s (1) cores
% 0.63/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.63/0.56 # Starting new_bool_3 with 226s (1) cores
% 0.63/0.56 # Starting new_bool_1 with 226s (1) cores
% 0.63/0.56 # Starting sh5l with 226s (1) cores
% 0.63/0.56 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3717 completed with status 0
% 0.63/0.56 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.63/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.63/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.63/0.56 # No SInE strategy applied
% 0.63/0.56 # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.63/0.56 # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.63/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 450s (1) cores
% 0.63/0.56 # Preprocessing time : 0.004 s
% 0.63/0.56 # Presaturation interreduction done
% 0.63/0.56
% 0.63/0.56 # Proof found!
% 0.63/0.56 # SZS status Theorem
% 0.63/0.56 # SZS output start CNFRefutation
% See solution above
% 0.63/0.56 # Parsed axioms : 196
% 0.63/0.56 # Removed by relevancy pruning/SinE : 0
% 0.63/0.56 # Initial clauses : 196
% 0.63/0.56 # Removed in clause preprocessing : 4
% 0.63/0.56 # Initial clauses in saturation : 192
% 0.63/0.56 # Processed clauses : 398
% 0.63/0.56 # ...of these trivial : 0
% 0.63/0.56 # ...subsumed : 7
% 0.63/0.56 # ...remaining for further processing : 391
% 0.63/0.56 # Other redundant clauses eliminated : 0
% 0.63/0.56 # Clauses deleted for lack of memory : 0
% 0.63/0.56 # Backward-subsumed : 5
% 0.63/0.56 # Backward-rewritten : 1
% 0.63/0.56 # Generated clauses : 245
% 0.63/0.56 # ...of the previous two non-redundant : 207
% 0.63/0.56 # ...aggressively subsumed : 0
% 0.63/0.56 # Contextual simplify-reflections : 0
% 0.63/0.56 # Paramodulations : 245
% 0.63/0.56 # Factorizations : 0
% 0.63/0.56 # NegExts : 0
% 0.63/0.56 # Equation resolutions : 0
% 0.63/0.56 # Disequality decompositions : 0
% 0.63/0.56 # Total rewrite steps : 6
% 0.63/0.56 # ...of those cached : 1
% 0.63/0.56 # Propositional unsat checks : 0
% 0.63/0.56 # Propositional check models : 0
% 0.63/0.56 # Propositional check unsatisfiable : 0
% 0.63/0.56 # Propositional clauses : 0
% 0.63/0.56 # Propositional clauses after purity: 0
% 0.63/0.56 # Propositional unsat core size : 0
% 0.63/0.56 # Propositional preprocessing time : 0.000
% 0.63/0.56 # Propositional encoding time : 0.000
% 0.63/0.56 # Propositional solver time : 0.000
% 0.63/0.56 # Success case prop preproc time : 0.000
% 0.63/0.56 # Success case prop encoding time : 0.000
% 0.63/0.56 # Success case prop solver time : 0.000
% 0.63/0.56 # Current number of processed clauses : 193
% 0.63/0.56 # Positive orientable unit clauses : 37
% 0.63/0.56 # Positive unorientable unit clauses: 0
% 0.63/0.56 # Negative unit clauses : 79
% 0.63/0.56 # Non-unit-clauses : 77
% 0.63/0.56 # Current number of unprocessed clauses: 193
% 0.63/0.56 # ...number of literals in the above : 590
% 0.63/0.56 # Current number of archived formulas : 0
% 0.63/0.56 # Current number of archived clauses : 202
% 0.63/0.56 # Clause-clause subsumption calls (NU) : 8730
% 0.63/0.56 # Rec. Clause-clause subsumption calls : 7100
% 0.63/0.56 # Non-unit clause-clause subsumptions : 12
% 0.63/0.56 # Unit Clause-clause subsumption calls : 2214
% 0.63/0.56 # Rewrite failures with RHS unbound : 0
% 0.63/0.56 # BW rewrite match attempts : 1
% 0.63/0.56 # BW rewrite match successes : 1
% 0.63/0.56 # Condensation attempts : 0
% 0.63/0.56 # Condensation successes : 0
% 0.63/0.56 # Termbank termtop insertions : 12111
% 0.63/0.56 # Search garbage collected termcells : 1535
% 0.63/0.56
% 0.63/0.56 # -------------------------------------------------
% 0.63/0.56 # User time : 0.032 s
% 0.63/0.56 # System time : 0.008 s
% 0.63/0.56 # Total time : 0.040 s
% 0.63/0.56 # Maximum resident set size: 2460 pages
% 0.63/0.56
% 0.63/0.56 # -------------------------------------------------
% 0.63/0.56 # User time : 0.137 s
% 0.63/0.56 # System time : 0.022 s
% 0.63/0.56 # Total time : 0.159 s
% 0.63/0.56 # Maximum resident set size: 1976 pages
% 0.63/0.56 % E---3.1 exiting
% 0.63/0.56 % E exiting
%------------------------------------------------------------------------------