TSTP Solution File: SWW961+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW961+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 21 06:44:19 EDT 2024
% Result : Theorem 0.22s 0.56s
% 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(ax173,axiom,
! [X122,X123,X124,X125] :
( ( pred_eq_bitstring_bitstring(name_Nb(X122),constr_adec(X124,name_skB))
& pred_attacker(tuple_client_B_in_5(X124))
& pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(X123,name_skB)))
& pred_attacker(tuple_client_B_in_3(X123))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X125,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_2(X125)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax173) ).
fof(ax89,axiom,
! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax89) ).
fof(ax120,axiom,
! [X66] :
( pred_attacker(X66)
=> pred_attacker(tuple_client_B_in_5(X66)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax120) ).
fof(ax122,axiom,
! [X68] :
( pred_attacker(X68)
=> pred_attacker(tuple_client_B_in_3(X68)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax122) ).
fof(ax124,axiom,
! [X70] :
( pred_attacker(X70)
=> pred_attacker(tuple_client_B_in_2(X70)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax124) ).
fof(ax162,axiom,
! [X113] : pred_attacker(name_new0x2Dname(X113)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax162) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(ax114,axiom,
! [X57] :
( pred_attacker(tuple_client_B_out_6(X57))
=> pred_attacker(X57) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax114) ).
fof(c_0_8,plain,
! [X252,X253,X254,X255] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X252),constr_adec(X254,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X254))
| ~ pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(X253,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X253))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X255,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X255))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax173])])]) ).
fof(c_0_9,plain,
! [X154,X155] : pred_eq_bitstring_bitstring(X154,X155),
inference(variable_rename,[status(thm)],[ax89]) ).
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_assoc_pair_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,
! [X196] :
( ~ pred_attacker(X196)
| pred_attacker(tuple_client_B_in_5(X196)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax120])])]) ).
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,
! [X198] :
( ~ pred_attacker(X198)
| pred_attacker(tuple_client_B_in_3(X198)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])])]) ).
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,
! [X200] :
( ~ pred_attacker(X200)
| pred_attacker(tuple_client_B_in_2(X200)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax124])])]) ).
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,
! [X243] : pred_attacker(name_new0x2Dname(X243)),
inference(variable_rename,[status(thm)],[ax162]) ).
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,
! [X187] :
( ~ pred_attacker(tuple_client_B_out_6(X187))
| pred_attacker(X187) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax114])])]) ).
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.08/0.14 % Problem : SWW961+1 : TPTP v8.2.0. Released v7.4.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n025.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sat May 18 19:18:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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/benchmark/theBenchmark.p
% 0.22/0.56 # Version: 3.1.0
% 0.22/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 # Starting sh5l with 300s (1) cores
% 0.22/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32375 completed with status 0
% 0.22/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.56 # No SInE strategy applied
% 0.22/0.56 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.22/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.56 # Starting sh5l with 136s (1) cores
% 0.22/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 32384 completed with status 0
% 0.22/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.22/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.56 # No SInE strategy applied
% 0.22/0.56 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.22/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.22/0.56 # Preprocessing time : 0.002 s
% 0.22/0.56 # Presaturation interreduction done
% 0.22/0.56
% 0.22/0.56 # Proof found!
% 0.22/0.56 # SZS status Theorem
% 0.22/0.56 # SZS output start CNFRefutation
% See solution above
% 0.22/0.56 # Parsed axioms : 177
% 0.22/0.56 # Removed by relevancy pruning/SinE : 0
% 0.22/0.56 # Initial clauses : 177
% 0.22/0.56 # Removed in clause preprocessing : 1
% 0.22/0.56 # Initial clauses in saturation : 176
% 0.22/0.56 # Processed clauses : 367
% 0.22/0.56 # ...of these trivial : 0
% 0.22/0.56 # ...subsumed : 6
% 0.22/0.56 # ...remaining for further processing : 361
% 0.22/0.56 # Other redundant clauses eliminated : 0
% 0.22/0.56 # Clauses deleted for lack of memory : 0
% 0.22/0.56 # Backward-subsumed : 5
% 0.22/0.56 # Backward-rewritten : 1
% 0.22/0.56 # Generated clauses : 222
% 0.22/0.56 # ...of the previous two non-redundant : 188
% 0.22/0.56 # ...aggressively subsumed : 0
% 0.22/0.56 # Contextual simplify-reflections : 0
% 0.22/0.56 # Paramodulations : 222
% 0.22/0.56 # Factorizations : 0
% 0.22/0.56 # NegExts : 0
% 0.22/0.56 # Equation resolutions : 0
% 0.22/0.56 # Disequality decompositions : 0
% 0.22/0.56 # Total rewrite steps : 12
% 0.22/0.56 # ...of those cached : 1
% 0.22/0.56 # Propositional unsat checks : 0
% 0.22/0.56 # Propositional check models : 0
% 0.22/0.56 # Propositional check unsatisfiable : 0
% 0.22/0.56 # Propositional clauses : 0
% 0.22/0.56 # Propositional clauses after purity: 0
% 0.22/0.56 # Propositional unsat core size : 0
% 0.22/0.56 # Propositional preprocessing time : 0.000
% 0.22/0.56 # Propositional encoding time : 0.000
% 0.22/0.56 # Propositional solver time : 0.000
% 0.22/0.56 # Success case prop preproc time : 0.000
% 0.22/0.56 # Success case prop encoding time : 0.000
% 0.22/0.56 # Success case prop solver time : 0.000
% 0.22/0.56 # Current number of processed clauses : 179
% 0.22/0.56 # Positive orientable unit clauses : 35
% 0.22/0.56 # Positive unorientable unit clauses: 0
% 0.22/0.56 # Negative unit clauses : 79
% 0.22/0.56 # Non-unit-clauses : 65
% 0.22/0.56 # Current number of unprocessed clauses: 173
% 0.22/0.56 # ...number of literals in the above : 487
% 0.22/0.56 # Current number of archived formulas : 0
% 0.22/0.56 # Current number of archived clauses : 183
% 0.22/0.56 # Clause-clause subsumption calls (NU) : 6082
% 0.22/0.56 # Rec. Clause-clause subsumption calls : 5821
% 0.22/0.56 # Non-unit clause-clause subsumptions : 11
% 0.22/0.56 # Unit Clause-clause subsumption calls : 1577
% 0.22/0.56 # Rewrite failures with RHS unbound : 0
% 0.22/0.56 # BW rewrite match attempts : 1
% 0.22/0.56 # BW rewrite match successes : 1
% 0.22/0.56 # Condensation attempts : 0
% 0.22/0.56 # Condensation successes : 0
% 0.22/0.56 # Termbank termtop insertions : 9806
% 0.22/0.56 # Search garbage collected termcells : 1226
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.021 s
% 0.22/0.56 # System time : 0.005 s
% 0.22/0.56 # Total time : 0.026 s
% 0.22/0.56 # Maximum resident set size: 2296 pages
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.082 s
% 0.22/0.56 # System time : 0.013 s
% 0.22/0.56 # Total time : 0.095 s
% 0.22/0.56 # Maximum resident set size: 1912 pages
% 0.22/0.56 % E---3.1 exiting
% 0.22/0.56 % E exiting
%------------------------------------------------------------------------------