TSTP Solution File: SWV237+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV237+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 05:33:44 EDT 2024
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 15 unt; 0 def)
% Number of atoms : 58 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 57 ( 27 ~; 24 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 4 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(encrypt_a_stored_comms_key,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(enc(i(tmk),X2),enc(i(tc),X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_a_stored_comms_key) ).
fof(intruder_knows_8,axiom,
p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_8) ).
fof(dec_enc_cancel,axiom,
! [X1,X2] : enc(X1,enc(i(X1),X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dec_enc_cancel) ).
fof(double_inverse_cancel,axiom,
! [X1] : i(i(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',double_inverse_cancel) ).
fof(encrypt_clear_key_as_Tcomms_key,axiom,
! [X1,X2,X3] :
( ( p(X1)
& p(X2)
& p(X3) )
=> p(enc(tc,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_clear_key_as_Tcomms_key) ).
fof(co1,conjecture,
p(enc(pp,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(intruder_knows_1,axiom,
p(enc(tmk,pp)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_1) ).
fof(c_0_7,plain,
! [X19,X20,X21] :
( ~ p(X19)
| ~ p(X20)
| ~ p(X21)
| p(enc(enc(i(tmk),X20),enc(i(tc),X19))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_a_stored_comms_key])])]) ).
cnf(c_0_8,plain,
( p(enc(enc(i(tmk),X2),enc(i(tc),X1)))
| ~ p(X1)
| ~ p(X2)
| ~ p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,plain,
p(a),
inference(split_conjunct,[status(thm)],[intruder_knows_8]) ).
fof(c_0_10,plain,
! [X10,X11] : enc(X10,enc(i(X10),X11)) = X11,
inference(variable_rename,[status(thm)],[dec_enc_cancel]) ).
fof(c_0_11,plain,
! [X12] : i(i(X12)) = X12,
inference(variable_rename,[status(thm)],[double_inverse_cancel]) ).
fof(c_0_12,plain,
! [X28,X29,X30] :
( ~ p(X28)
| ~ p(X29)
| ~ p(X30)
| p(enc(tc,X28)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[encrypt_clear_key_as_Tcomms_key])])]) ).
cnf(c_0_13,plain,
( p(enc(enc(i(tmk),X1),enc(i(tc),X2)))
| ~ p(X1)
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
enc(X1,enc(i(X1),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
i(i(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( p(enc(tc,X1))
| ~ p(X1)
| ~ p(X2)
| ~ p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( p(enc(enc(i(tmk),X1),X2))
| ~ p(enc(tc,X2))
| ~ p(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
( p(enc(tc,X1))
| ~ p(X2)
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
fof(c_0_19,negated_conjecture,
~ p(enc(pp,a)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_20,plain,
( p(enc(X1,X2))
| ~ p(enc(tc,X2))
| ~ p(enc(tmk,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_15]) ).
cnf(c_0_21,plain,
( p(enc(tc,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
fof(c_0_22,negated_conjecture,
~ p(enc(pp,a)),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( p(enc(X1,X2))
| ~ p(enc(tmk,X1))
| ~ p(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
p(enc(tmk,pp)),
inference(split_conjunct,[status(thm)],[intruder_knows_1]) ).
cnf(c_0_25,negated_conjecture,
~ p(enc(pp,a)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( p(enc(pp,X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV237+1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.12/0.35 % Computer : n012.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sun May 19 09:02:08 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.52 # Version: 3.1.0
% 0.19/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # new_bool_1 with pid 16249 completed with status 0
% 0.19/0.52 # Result found by new_bool_1
% 0.19/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FHUSS-FFSF21-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 121s (1) cores
% 0.19/0.52 # SAT001_MinMin_p005000_rr_RG with pid 16252 completed with status 0
% 0.19/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FHUSS-FFSF21-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 121s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Theorem
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 25
% 0.19/0.52 # Removed by relevancy pruning/SinE : 9
% 0.19/0.52 # Initial clauses : 16
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 16
% 0.19/0.52 # Processed clauses : 359
% 0.19/0.52 # ...of these trivial : 1
% 0.19/0.52 # ...subsumed : 203
% 0.19/0.52 # ...remaining for further processing : 155
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 55
% 0.19/0.52 # Backward-rewritten : 0
% 0.19/0.52 # Generated clauses : 864
% 0.19/0.52 # ...of the previous two non-redundant : 770
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 2
% 0.19/0.52 # Paramodulations : 864
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Disequality decompositions : 0
% 0.19/0.52 # Total rewrite steps : 113
% 0.19/0.52 # ...of those cached : 92
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 84
% 0.19/0.52 # Positive orientable unit clauses : 6
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 7
% 0.19/0.52 # Non-unit-clauses : 71
% 0.19/0.52 # Current number of unprocessed clauses: 318
% 0.19/0.52 # ...number of literals in the above : 1504
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 71
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 6309
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 4221
% 0.19/0.52 # Non-unit clause-clause subsumptions : 201
% 0.19/0.52 # Unit Clause-clause subsumption calls : 142
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 0
% 0.19/0.52 # BW rewrite match successes : 0
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 15581
% 0.19/0.52 # Search garbage collected termcells : 249
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.020 s
% 0.19/0.52 # System time : 0.005 s
% 0.19/0.52 # Total time : 0.025 s
% 0.19/0.52 # Maximum resident set size: 1732 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.021 s
% 0.19/0.52 # System time : 0.008 s
% 0.19/0.52 # Total time : 0.029 s
% 0.19/0.52 # Maximum resident set size: 1712 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------