TSTP Solution File: ITP091^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP091^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 May 20 22:16:16 EDT 2024
% Result : Theorem 0.72s 0.59s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 18
% Syntax : Number of formulae : 29 ( 11 unt; 14 typ; 0 def)
% Number of atoms : 25 ( 2 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 90 ( 10 ~; 7 |; 2 &; 70 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 0 ^ 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
secrecy_specID: $tType ).
thf(decl_sort2,type,
set_Secrecy_KS: $tType ).
thf(decl_sort3,type,
secrecy_KS: $tType ).
thf(decl_sort4,type,
secrecy_Expression: $tType ).
thf(decl_sort5,type,
secrecy_Secrets: $tType ).
thf(decl_22,type,
localSecrets: secrecy_specID > set_Secrecy_KS ).
thf(decl_24,type,
knowle945212990e_know: secrecy_specID > secrecy_KS > $o ).
thf(decl_46,type,
ine: secrecy_specID > secrecy_Expression > $o ).
thf(decl_57,type,
secrecy_sE: secrecy_Secrets > secrecy_Expression ).
thf(decl_60,type,
secrecy_sKS: secrecy_Secrets > secrecy_KS ).
thf(decl_90,type,
member_Secrecy_KS: secrecy_KS > set_Secrecy_KS > $o ).
thf(decl_97,type,
q: secrecy_specID ).
thf(decl_98,type,
m: secrecy_KS ).
thf(decl_99,type,
secret: secrecy_Secrets ).
thf(fact_8_know_Osimps_I2_J,axiom,
! [X3: secrecy_specID,X4: secrecy_Secrets] :
( ( knowle945212990e_know @ X3 @ ( secrecy_sKS @ X4 ) )
<=> ( ( ine @ X3 @ ( secrecy_sE @ X4 ) )
| ( member_Secrecy_KS @ ( secrecy_sKS @ X4 ) @ ( localSecrets @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_8_know_Osimps_I2_J) ).
thf(conj_0,conjecture,
~ ( member_Secrecy_KS @ ( secrecy_sKS @ secret ) @ ( localSecrets @ q ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_not__knowQm,axiom,
~ ( knowle945212990e_know @ q @ m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_not__knowQm) ).
thf(fact_1_a2,axiom,
( m
= ( secrecy_sKS @ secret ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_a2) ).
thf(c_0_4,plain,
! [X1255: secrecy_specID,X1256: secrecy_Secrets] :
( ( ~ ( knowle945212990e_know @ X1255 @ ( secrecy_sKS @ X1256 ) )
| ( ine @ X1255 @ ( secrecy_sE @ X1256 ) )
| ( member_Secrecy_KS @ ( secrecy_sKS @ X1256 ) @ ( localSecrets @ X1255 ) ) )
& ( ~ ( ine @ X1255 @ ( secrecy_sE @ X1256 ) )
| ( knowle945212990e_know @ X1255 @ ( secrecy_sKS @ X1256 ) ) )
& ( ~ ( member_Secrecy_KS @ ( secrecy_sKS @ X1256 ) @ ( localSecrets @ X1255 ) )
| ( knowle945212990e_know @ X1255 @ ( secrecy_sKS @ X1256 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_know_Osimps_I2_J])])])]) ).
thf(c_0_5,negated_conjecture,
member_Secrecy_KS @ ( secrecy_sKS @ secret ) @ ( localSecrets @ q ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_6,plain,
~ ( knowle945212990e_know @ q @ m ),
inference(fof_simplification,[status(thm)],[fact_0_not__knowQm]) ).
thf(c_0_7,plain,
! [X1: secrecy_Secrets,X3: secrecy_specID] :
( ( knowle945212990e_know @ X3 @ ( secrecy_sKS @ X1 ) )
| ~ ( member_Secrecy_KS @ ( secrecy_sKS @ X1 ) @ ( localSecrets @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
( m
= ( secrecy_sKS @ secret ) ),
inference(split_conjunct,[status(thm)],[fact_1_a2]) ).
thf(c_0_9,negated_conjecture,
member_Secrecy_KS @ ( secrecy_sKS @ secret ) @ ( localSecrets @ q ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
~ ( knowle945212990e_know @ q @ m ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_11,plain,
! [X3: secrecy_specID] :
( ( knowle945212990e_know @ X3 @ m )
| ~ ( member_Secrecy_KS @ m @ ( localSecrets @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,negated_conjecture,
member_Secrecy_KS @ m @ ( localSecrets @ q ),
inference(rw,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_13,plain,
~ ( knowle945212990e_know @ q @ m ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ITP091^1 : TPTP v8.2.0. Released v7.5.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.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 : Sat May 18 16:23:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.45 Running higher-order theorem proving
% 0.21/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.72/0.59 # Version: 3.1.0-ho
% 0.72/0.59 # Preprocessing class: HSLSSMSMSSMNSFA.
% 0.72/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.59 # Starting new_ho_3 with 1500s (5) cores
% 0.72/0.59 # Starting pre_casc_2 with 300s (1) cores
% 0.72/0.59 # Starting additional_ho_7 with 300s (1) cores
% 0.72/0.59 # Starting lpo8_s with 300s (1) cores
% 0.72/0.59 # additional_ho_7 with pid 5516 completed with status 0
% 0.72/0.59 # Result found by additional_ho_7
% 0.72/0.59 # Preprocessing class: HSLSSMSMSSMNSFA.
% 0.72/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.59 # Starting new_ho_3 with 1500s (5) cores
% 0.72/0.59 # Starting pre_casc_2 with 300s (1) cores
% 0.72/0.59 # Starting additional_ho_7 with 300s (1) cores
% 0.72/0.59 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.72/0.59 # Search class: HGHSM-FSLM32-SSFFFFBN
% 0.72/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.72/0.59 # Starting new_bool_3 with 163s (1) cores
% 0.72/0.59 # new_bool_3 with pid 5518 completed with status 0
% 0.72/0.59 # Result found by new_bool_3
% 0.72/0.59 # Preprocessing class: HSLSSMSMSSMNSFA.
% 0.72/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.59 # Starting new_ho_3 with 1500s (5) cores
% 0.72/0.59 # Starting pre_casc_2 with 300s (1) cores
% 0.72/0.59 # Starting additional_ho_7 with 300s (1) cores
% 0.72/0.59 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.72/0.59 # Search class: HGHSM-FSLM32-SSFFFFBN
% 0.72/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.72/0.59 # Starting new_bool_3 with 163s (1) cores
% 0.72/0.59 # Preprocessing time : 0.011 s
% 0.72/0.59 # Presaturation interreduction done
% 0.72/0.59
% 0.72/0.59 # Proof found!
% 0.72/0.59 # SZS status Theorem
% 0.72/0.59 # SZS output start CNFRefutation
% See solution above
% 0.72/0.59 # Parsed axioms : 447
% 0.72/0.59 # Removed by relevancy pruning/SinE : 246
% 0.72/0.59 # Initial clauses : 403
% 0.72/0.59 # Removed in clause preprocessing : 18
% 0.72/0.59 # Initial clauses in saturation : 385
% 0.72/0.59 # Processed clauses : 464
% 0.72/0.59 # ...of these trivial : 6
% 0.72/0.59 # ...subsumed : 89
% 0.72/0.59 # ...remaining for further processing : 369
% 0.72/0.59 # Other redundant clauses eliminated : 58
% 0.72/0.59 # Clauses deleted for lack of memory : 0
% 0.72/0.59 # Backward-subsumed : 8
% 0.72/0.59 # Backward-rewritten : 2
% 0.72/0.59 # Generated clauses : 74
% 0.72/0.59 # ...of the previous two non-redundant : 47
% 0.72/0.59 # ...aggressively subsumed : 0
% 0.72/0.59 # Contextual simplify-reflections : 16
% 0.72/0.59 # Paramodulations : 27
% 0.72/0.59 # Factorizations : 0
% 0.72/0.59 # NegExts : 0
% 0.72/0.59 # Equation resolutions : 62
% 0.72/0.59 # Disequality decompositions : 0
% 0.72/0.59 # Total rewrite steps : 28
% 0.72/0.59 # ...of those cached : 13
% 0.72/0.59 # Propositional unsat checks : 0
% 0.72/0.59 # Propositional check models : 0
% 0.72/0.59 # Propositional check unsatisfiable : 0
% 0.72/0.59 # Propositional clauses : 0
% 0.72/0.59 # Propositional clauses after purity: 0
% 0.72/0.59 # Propositional unsat core size : 0
% 0.72/0.59 # Propositional preprocessing time : 0.000
% 0.72/0.59 # Propositional encoding time : 0.000
% 0.72/0.59 # Propositional solver time : 0.000
% 0.72/0.59 # Success case prop preproc time : 0.000
% 0.72/0.59 # Success case prop encoding time : 0.000
% 0.72/0.59 # Success case prop solver time : 0.000
% 0.72/0.59 # Current number of processed clauses : 53
% 0.72/0.59 # Positive orientable unit clauses : 13
% 0.72/0.59 # Positive unorientable unit clauses: 0
% 0.72/0.59 # Negative unit clauses : 17
% 0.72/0.59 # Non-unit-clauses : 23
% 0.72/0.59 # Current number of unprocessed clauses: 232
% 0.72/0.59 # ...number of literals in the above : 982
% 0.72/0.59 # Current number of archived formulas : 0
% 0.72/0.59 # Current number of archived clauses : 274
% 0.72/0.59 # Clause-clause subsumption calls (NU) : 27279
% 0.72/0.59 # Rec. Clause-clause subsumption calls : 2856
% 0.72/0.59 # Non-unit clause-clause subsumptions : 98
% 0.72/0.59 # Unit Clause-clause subsumption calls : 31
% 0.72/0.59 # Rewrite failures with RHS unbound : 0
% 0.72/0.59 # BW rewrite match attempts : 29
% 0.72/0.59 # BW rewrite match successes : 19
% 0.72/0.59 # Condensation attempts : 0
% 0.72/0.59 # Condensation successes : 0
% 0.72/0.59 # Termbank termtop insertions : 67665
% 0.72/0.59 # Search garbage collected termcells : 13406
% 0.72/0.59
% 0.72/0.59 # -------------------------------------------------
% 0.72/0.59 # User time : 0.089 s
% 0.72/0.59 # System time : 0.011 s
% 0.72/0.59 # Total time : 0.100 s
% 0.72/0.59 # Maximum resident set size: 4452 pages
% 0.72/0.59
% 0.72/0.59 # -------------------------------------------------
% 0.72/0.59 # User time : 0.105 s
% 0.72/0.59 # System time : 0.014 s
% 0.72/0.59 # Total time : 0.119 s
% 0.72/0.59 # Maximum resident set size: 2688 pages
% 0.72/0.59 % E---3.1 exiting
% 0.72/0.59 % E exiting
%------------------------------------------------------------------------------