TSTP Solution File: SWW965+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWW965+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:10:14 EDT 2023
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 82 ( 37 ~; 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/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',ax184) ).
fof(ax103,axiom,
! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
file('/export/starexec/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',ax103) ).
fof(ax137,axiom,
! [X70] :
( pred_attacker(X70)
=> pred_attacker(tuple_client_B_in_5(X70)) ),
file('/export/starexec/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',ax137) ).
fof(ax139,axiom,
! [X72] :
( pred_attacker(X72)
=> pred_attacker(tuple_client_B_in_3(X72)) ),
file('/export/starexec/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',ax139) ).
fof(ax141,axiom,
! [X74] :
( pred_attacker(X74)
=> pred_attacker(tuple_client_B_in_2(X74)) ),
file('/export/starexec/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',ax141) ).
fof(ax173,axiom,
! [X107] : pred_attacker(name_new0x2Dname(X107)),
file('/export/starexec/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',ax173) ).
fof(ax131,axiom,
! [X61] :
( pred_attacker(tuple_client_B_out_6(X61))
=> pred_attacker(X61) ),
file('/export/starexec/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',ax131) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p',co0) ).
fof(c_0_8,plain,
! [X240,X241,X242,X243] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X240),constr_adec(X242,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X242))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X241,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X241))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X243,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X243))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax184])]) ).
fof(c_0_9,plain,
! [X148,X149] : pred_eq_bitstring_bitstring(X148,X149),
inference(variable_rename,[status(thm)],[ax103]) ).
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,
! [X194] :
( ~ pred_attacker(X194)
| pred_attacker(tuple_client_B_in_5(X194)) ),
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(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,
! [X196] :
( ~ pred_attacker(X196)
| pred_attacker(tuple_client_B_in_3(X196)) ),
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,
! [X198] :
( ~ pred_attacker(X198)
| pred_attacker(tuple_client_B_in_2(X198)) ),
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,
! [X231] : pred_attacker(name_new0x2Dname(X231)),
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,plain,
! [X185] :
( ~ pred_attacker(tuple_client_B_out_6(X185))
| pred_attacker(X185) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax131])]) ).
cnf(c_0_26,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_27,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_28,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_B_out_6(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWW965+1 : TPTP v8.1.2. Released v7.4.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n011.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 22:58:08 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.WgSiFqU7tr/E---3.1_20452.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 20530 completed with status 0
% 0.17/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FGUSM-FFMM21-DFFFFFNN
% 0.17/0.48 # partial match(1): FGUSM-FFMF21-DFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 675s (1) cores
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.17/0.48 # Starting new_bool_3 with 169s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 169s (1) cores
% 0.17/0.48 # Starting sh5l with 169s (1) cores
% 0.17/0.48 # SAT001_MinMin_p005000_rr_RG with pid 20536 completed with status 0
% 0.17/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.48 # No SInE strategy applied
% 0.17/0.48 # Search class: FGUSM-FFMM21-DFFFFFNN
% 0.17/0.48 # partial match(1): FGUSM-FFMF21-DFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 675s (1) cores
% 0.17/0.48 # Preprocessing time : 0.002 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Theorem
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 188
% 0.17/0.48 # Removed by relevancy pruning/SinE : 0
% 0.17/0.48 # Initial clauses : 188
% 0.17/0.48 # Removed in clause preprocessing : 1
% 0.17/0.48 # Initial clauses in saturation : 187
% 0.17/0.48 # Processed clauses : 397
% 0.17/0.48 # ...of these trivial : 1
% 0.17/0.48 # ...subsumed : 11
% 0.17/0.48 # ...remaining for further processing : 385
% 0.17/0.48 # Other redundant clauses eliminated : 0
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 5
% 0.17/0.48 # Backward-rewritten : 1
% 0.17/0.48 # Generated clauses : 234
% 0.17/0.48 # ...of the previous two non-redundant : 192
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 0
% 0.17/0.48 # Paramodulations : 234
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 0
% 0.17/0.48 # Total rewrite steps : 23
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 192
% 0.17/0.48 # Positive orientable unit clauses : 37
% 0.17/0.48 # Positive unorientable unit clauses: 1
% 0.17/0.48 # Negative unit clauses : 92
% 0.17/0.48 # Non-unit-clauses : 62
% 0.17/0.48 # Current number of unprocessed clauses: 149
% 0.17/0.48 # ...number of literals in the above : 435
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 194
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 5345
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 5175
% 0.17/0.48 # Non-unit clause-clause subsumptions : 16
% 0.17/0.48 # Unit Clause-clause subsumption calls : 1478
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 13
% 0.17/0.48 # BW rewrite match successes : 11
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 8652
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.016 s
% 0.17/0.48 # System time : 0.005 s
% 0.17/0.48 # Total time : 0.022 s
% 0.17/0.48 # Maximum resident set size: 2332 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.067 s
% 0.17/0.48 # System time : 0.014 s
% 0.17/0.48 # Total time : 0.081 s
% 0.17/0.48 # Maximum resident set size: 1904 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------